/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:09:48,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:09:48,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:09:48,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:09:48,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:09:48,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:09:48,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:09:48,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:09:48,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:09:48,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:09:48,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:09:48,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:09:48,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:09:48,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:09:48,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:09:48,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:09:48,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:09:48,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:09:48,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:09:48,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:09:48,306 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:09:48,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:09:48,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:09:48,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:09:48,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:09:48,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:09:48,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:09:48,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:09:48,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:09:48,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:09:48,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:09:48,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:09:48,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:09:48,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:09:48,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:09:48,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:09:48,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:09:48,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:09:48,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:09:48,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:09:48,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:09:48,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:09:48,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 21:09:48,332 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:09:48,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:09:48,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:09:48,333 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 21:09:48,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:09:48,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 21:09:48,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:09:48,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:09:48,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:09:48,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:09:48,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:09:48,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:09:48,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:09:48,336 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:09:48,336 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 21:09:48,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:09:48,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:09:48,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:09:48,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:09:48,565 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:09:48,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c [2022-04-07 21:09:48,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8947d7873/de0c32a277704ee0a9091d010976257c/FLAGd8ba2dc88 [2022-04-07 21:09:48,929 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:09:48,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c [2022-04-07 21:09:48,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8947d7873/de0c32a277704ee0a9091d010976257c/FLAGd8ba2dc88 [2022-04-07 21:09:49,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8947d7873/de0c32a277704ee0a9091d010976257c [2022-04-07 21:09:49,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:09:49,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:09:49,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:09:49,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:09:49,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:09:49,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725d0e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49, skipping insertion in model container [2022-04-07 21:09:49,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:09:49,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:09:49,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c[520,533] [2022-04-07 21:09:49,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:09:49,545 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:09:49,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c[520,533] [2022-04-07 21:09:49,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:09:49,568 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:09:49,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49 WrapperNode [2022-04-07 21:09:49,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:09:49,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:09:49,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:09:49,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:09:49,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:09:49,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:09:49,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:09:49,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:09:49,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:09:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:09:49,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 21:09:49,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 21:09:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:09:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:09:49,653 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:09:49,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 21:09:49,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 21:09:49,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:09:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:09:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:09:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:09:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:09:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 21:09:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 21:09:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 21:09:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:09:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:09:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:09:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:09:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:09:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:09:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:09:49,702 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:09:49,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:09:49,811 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:09:49,816 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:09:49,816 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:09:49,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:09:49 BoogieIcfgContainer [2022-04-07 21:09:49,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:09:49,817 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:09:49,817 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:09:49,818 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:09:49,820 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:09:49" (1/1) ... [2022-04-07 21:09:49,821 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 21:09:49,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:09:49 BasicIcfg [2022-04-07 21:09:49,835 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:09:49,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:09:49,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:09:49,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:09:49,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:09:49" (1/4) ... [2022-04-07 21:09:49,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196b866c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:09:49, skipping insertion in model container [2022-04-07 21:09:49,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:09:49" (2/4) ... [2022-04-07 21:09:49,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196b866c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:09:49, skipping insertion in model container [2022-04-07 21:09:49,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:09:49" (3/4) ... [2022-04-07 21:09:49,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196b866c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:09:49, skipping insertion in model container [2022-04-07 21:09:49,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:09:49" (4/4) ... [2022-04-07 21:09:49,839 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound2.cJordan [2022-04-07 21:09:49,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:09:49,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:09:49,911 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:09:49,916 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 21:09:49,916 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:09:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 21:09:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 21:09:49,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:09:49,951 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:49,951 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:09:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:09:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1238828824, now seen corresponding path program 1 times [2022-04-07 21:09:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:09:49,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540444112] [2022-04-07 21:09:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:09:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:09:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:50,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-07 21:09:50,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 21:09:50,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 21:09:50,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:09:50,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-07 21:09:50,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 21:09:50,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 21:09:50,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 21:09:50,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {29#true} is VALID [2022-04-07 21:09:50,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [75] L30-3-->L30-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 21:09:50,174 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {30#false} is VALID [2022-04-07 21:09:50,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#false} is VALID [2022-04-07 21:09:50,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 21:09:50,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 21:09:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:09:50,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:09:50,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540444112] [2022-04-07 21:09:50,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540444112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:09:50,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:09:50,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 21:09:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904408942] [2022-04-07 21:09:50,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:09:50,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 21:09:50,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:09:50,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:50,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 21:09:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:09:50,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 21:09:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 21:09:50,224 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:50,332 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-07 21:09:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 21:09:50,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 21:09:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:09:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 21:09:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 21:09:50,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-07 21:09:50,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:50,393 INFO L225 Difference]: With dead ends: 27 [2022-04-07 21:09:50,393 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 21:09:50,395 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 21:09:50,397 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:09:50,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:09:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 21:09:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-07 21:09:50,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:09:50,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 21:09:50,421 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 21:09:50,422 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 21:09:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:50,429 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-07 21:09:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-07 21:09:50,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:50,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:50,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-07 21:09:50,430 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-07 21:09:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:50,434 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-07 21:09:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-07 21:09:50,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:50,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:50,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:09:50,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:09:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 21:09:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-07 21:09:50,438 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-07 21:09:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:09:50,438 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-07 21:09:50,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-07 21:09:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 21:09:50,440 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:09:50,440 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:50,442 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:09:50,443 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:09:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:09:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash -221581531, now seen corresponding path program 1 times [2022-04-07 21:09:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:09:50,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523270943] [2022-04-07 21:09:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:09:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:09:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:50,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {134#(= ~counter~0 0)} is VALID [2022-04-07 21:09:50,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#(= ~counter~0 0)} is VALID [2022-04-07 21:09:50,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134#(= ~counter~0 0)} {129#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#(= ~counter~0 0)} is VALID [2022-04-07 21:09:50,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:09:50,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {134#(= ~counter~0 0)} is VALID [2022-04-07 21:09:50,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#(= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#(= ~counter~0 0)} is VALID [2022-04-07 21:09:50,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134#(= ~counter~0 0)} {129#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#(= ~counter~0 0)} is VALID [2022-04-07 21:09:50,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {134#(= ~counter~0 0)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#(= ~counter~0 0)} is VALID [2022-04-07 21:09:50,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#(= ~counter~0 0)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {134#(= ~counter~0 0)} is VALID [2022-04-07 21:09:50,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#(= ~counter~0 0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {135#(= |main_#t~post5| 0)} is VALID [2022-04-07 21:09:50,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {135#(= |main_#t~post5| 0)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {130#false} is VALID [2022-04-07 21:09:50,525 INFO L272 TraceCheckUtils]: 8: Hoare triple {130#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {130#false} is VALID [2022-04-07 21:09:50,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {130#false} is VALID [2022-04-07 21:09:50,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#false} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-07 21:09:50,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-07 21:09:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:09:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:09:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523270943] [2022-04-07 21:09:50,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523270943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:09:50,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:09:50,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:09:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557612933] [2022-04-07 21:09:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:09:50,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 21:09:50,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:09:50,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:50,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 21:09:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:09:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 21:09:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:09:50,538 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:50,649 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 21:09:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 21:09:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 21:09:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:09:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-07 21:09:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-07 21:09:50,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-07 21:09:50,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:50,677 INFO L225 Difference]: With dead ends: 23 [2022-04-07 21:09:50,677 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 21:09:50,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 21:09:50,678 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:09:50,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:09:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 21:09:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-07 21:09:50,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:09:50,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 21:09:50,681 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 21:09:50,681 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 21:09:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:50,682 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 21:09:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 21:09:50,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:50,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:50,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-07 21:09:50,684 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-07 21:09:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:50,685 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 21:09:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 21:09:50,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:50,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:50,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:09:50,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:09:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 21:09:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-07 21:09:50,687 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-07 21:09:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:09:50,687 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-07 21:09:50,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 21:09:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 21:09:50,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:09:50,688 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:50,688 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:09:50,688 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:09:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:09:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash -220509055, now seen corresponding path program 1 times [2022-04-07 21:09:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:09:50,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441980192] [2022-04-07 21:09:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:09:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:09:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:50,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {233#true} is VALID [2022-04-07 21:09:50,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-07 21:09:50,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {233#true} {233#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-07 21:09:50,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {233#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:09:50,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {233#true} is VALID [2022-04-07 21:09:50,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {233#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-07 21:09:50,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-07 21:09:50,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {233#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-07 21:09:50,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {233#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {238#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-07 21:09:50,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {238#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-07 21:09:50,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {238#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-07 21:09:50,805 INFO L272 TraceCheckUtils]: 8: Hoare triple {238#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {239#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 21:09:50,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#(not (= |__VERIFIER_assert_#in~cond| 0))} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {240#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 21:09:50,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#(not (= __VERIFIER_assert_~cond 0))} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {234#false} is VALID [2022-04-07 21:09:50,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#false} is VALID [2022-04-07 21:09:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:09:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:09:50,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441980192] [2022-04-07 21:09:50,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441980192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:09:50,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:09:50,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 21:09:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403145993] [2022-04-07 21:09:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:09:50,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 21:09:50,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:09:50,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:50,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:50,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 21:09:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:09:50,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 21:09:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 21:09:50,853 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:51,186 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-07 21:09:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 21:09:51,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 21:09:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:09:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-07 21:09:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-07 21:09:51,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-07 21:09:51,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:51,235 INFO L225 Difference]: With dead ends: 34 [2022-04-07 21:09:51,235 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 21:09:51,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 21:09:51,236 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:09:51,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:09:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 21:09:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-07 21:09:51,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:09:51,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 21:09:51,240 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 21:09:51,240 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 21:09:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:51,242 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-07 21:09:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-07 21:09:51,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:51,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:51,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-07 21:09:51,243 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-07 21:09:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:51,245 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-07 21:09:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-07 21:09:51,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:51,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:51,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:09:51,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:09:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 21:09:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 21:09:51,247 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-07 21:09:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:09:51,247 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 21:09:51,248 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:09:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 21:09:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 21:09:51,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:09:51,248 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:51,248 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:09:51,248 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:09:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:09:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1748396925, now seen corresponding path program 1 times [2022-04-07 21:09:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:09:51,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624948288] [2022-04-07 21:09:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:09:51,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 21:09:51,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286840511] [2022-04-07 21:09:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:51,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:51,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:09:51,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 21:09:51,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 21:09:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:51,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 21:09:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:51,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:09:51,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-07 21:09:51,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {386#true} is VALID [2022-04-07 21:09:51,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-07 21:09:51,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-07 21:09:51,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-07 21:09:51,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {406#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-07 21:09:51,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {406#(and (= main_~a~0 0) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {406#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-07 21:09:51,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {406#(and (= main_~a~0 0) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {406#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-07 21:09:51,461 INFO L272 TraceCheckUtils]: 8: Hoare triple {406#(and (= main_~a~0 0) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {386#true} is VALID [2022-04-07 21:09:51,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {386#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {386#true} is VALID [2022-04-07 21:09:51,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-07 21:09:51,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-07 21:09:51,462 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {386#true} {406#(and (= main_~a~0 0) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {406#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-07 21:09:51,463 INFO L272 TraceCheckUtils]: 13: Hoare triple {406#(and (= main_~a~0 0) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {431#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:09:51,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {431#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {435#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:09:51,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {435#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {387#false} is VALID [2022-04-07 21:09:51,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {387#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {387#false} is VALID [2022-04-07 21:09:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:09:51,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 21:09:51,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:09:51,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624948288] [2022-04-07 21:09:51,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 21:09:51,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286840511] [2022-04-07 21:09:51,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286840511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:09:51,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:09:51,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 21:09:51,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438431323] [2022-04-07 21:09:51,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:09:51,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 21:09:51,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:09:51,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:09:51,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:51,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 21:09:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:09:51,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 21:09:51,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:09:51,480 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:09:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:51,595 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-07 21:09:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 21:09:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 21:09:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:09:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:09:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 21:09:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:09:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 21:09:51,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-07 21:09:51,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:51,643 INFO L225 Difference]: With dead ends: 38 [2022-04-07 21:09:51,643 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 21:09:51,644 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 21:09:51,644 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:09:51,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:09:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 21:09:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-07 21:09:51,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:09:51,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 21:09:51,648 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 21:09:51,648 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 21:09:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:51,650 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-07 21:09:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-07 21:09:51,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:51,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:51,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-07 21:09:51,651 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-07 21:09:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:51,652 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-07 21:09:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-07 21:09:51,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:51,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:51,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:09:51,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:09:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 21:09:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-07 21:09:51,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-07 21:09:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:09:51,655 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-07 21:09:51,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:09:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-07 21:09:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 21:09:51,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:09:51,655 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:51,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 21:09:51,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:51,872 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:09:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:09:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash -214718627, now seen corresponding path program 1 times [2022-04-07 21:09:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:09:51,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981317893] [2022-04-07 21:09:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:09:51,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 21:09:51,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014694541] [2022-04-07 21:09:51,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:51,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:51,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:09:51,882 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 21:09:51,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 21:09:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:51,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 21:09:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:51,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:09:52,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {594#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#true} is VALID [2022-04-07 21:09:52,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {594#true} is VALID [2022-04-07 21:09:52,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#true} is VALID [2022-04-07 21:09:52,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {594#true} {594#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#true} is VALID [2022-04-07 21:09:52,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {594#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#true} is VALID [2022-04-07 21:09:52,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {594#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {614#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:52,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(and (= main_~t~0 1) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {614#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:52,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#(and (= main_~t~0 1) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {614#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:52,056 INFO L272 TraceCheckUtils]: 8: Hoare triple {614#(and (= main_~t~0 1) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {594#true} is VALID [2022-04-07 21:09:52,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {594#true} is VALID [2022-04-07 21:09:52,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {594#true} is VALID [2022-04-07 21:09:52,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#true} is VALID [2022-04-07 21:09:52,057 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {594#true} {614#(and (= main_~t~0 1) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {614#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:52,057 INFO L272 TraceCheckUtils]: 13: Hoare triple {614#(and (= main_~t~0 1) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {594#true} is VALID [2022-04-07 21:09:52,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {594#true} is VALID [2022-04-07 21:09:52,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {594#true} is VALID [2022-04-07 21:09:52,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#true} is VALID [2022-04-07 21:09:52,058 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {594#true} {614#(and (= main_~t~0 1) (= main_~s~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {614#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:52,059 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(and (= main_~t~0 1) (= main_~s~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {654#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:09:52,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:09:52,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {595#false} is VALID [2022-04-07 21:09:52,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {595#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#false} is VALID [2022-04-07 21:09:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 21:09:52,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 21:09:52,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:09:52,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981317893] [2022-04-07 21:09:52,060 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 21:09:52,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014694541] [2022-04-07 21:09:52,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014694541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:09:52,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:09:52,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 21:09:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888636648] [2022-04-07 21:09:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:09:52,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 21:09:52,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:09:52,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:09:52,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:52,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 21:09:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:09:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 21:09:52,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:09:52,075 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:09:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:52,198 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-07 21:09:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 21:09:52,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 21:09:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:09:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:09:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 21:09:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:09:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 21:09:52,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-07 21:09:52,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:52,236 INFO L225 Difference]: With dead ends: 42 [2022-04-07 21:09:52,236 INFO L226 Difference]: Without dead ends: 39 [2022-04-07 21:09:52,236 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 21:09:52,237 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:09:52,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:09:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-07 21:09:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-07 21:09:52,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:09:52,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:52,240 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:52,240 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:52,241 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-07 21:09:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-07 21:09:52,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:52,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:52,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-07 21:09:52,242 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-07 21:09:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:52,243 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-07 21:09:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-07 21:09:52,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:52,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:52,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:09:52,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:09:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-07 21:09:52,245 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-07 21:09:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:09:52,245 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-07 21:09:52,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:09:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-07 21:09:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 21:09:52,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:09:52,246 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:52,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 21:09:52,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:52,467 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:09:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:09:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1697115236, now seen corresponding path program 1 times [2022-04-07 21:09:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:09:52,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972122523] [2022-04-07 21:09:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:09:52,482 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 21:09:52,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322888008] [2022-04-07 21:09:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:09:52,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 21:09:52,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 21:09:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:52,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 21:09:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:52,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:09:52,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {825#true} is VALID [2022-04-07 21:09:52,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#(<= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#(<= ~counter~0 0)} {825#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#(<= ~counter~0 0)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#(<= ~counter~0 0)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#(<= ~counter~0 0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#(<= ~counter~0 1)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,660 INFO L272 TraceCheckUtils]: 8: Hoare triple {849#(<= ~counter~0 1)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#(<= ~counter~0 1)} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,661 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {849#(<= ~counter~0 1)} {849#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,662 INFO L272 TraceCheckUtils]: 13: Hoare triple {849#(<= ~counter~0 1)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {849#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {849#(<= ~counter~0 1)} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {849#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,663 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {849#(<= ~counter~0 1)} {849#(<= ~counter~0 1)} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,663 INFO L272 TraceCheckUtils]: 18: Hoare triple {849#(<= ~counter~0 1)} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#(<= ~counter~0 1)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#(<= ~counter~0 1)} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {849#(<= ~counter~0 1)} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,665 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {849#(<= ~counter~0 1)} {849#(<= ~counter~0 1)} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {849#(<= ~counter~0 1)} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {849#(<= ~counter~0 1)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {904#(<= |main_#t~post5| 1)} is VALID [2022-04-07 21:09:52,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {904#(<= |main_#t~post5| 1)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {826#false} is VALID [2022-04-07 21:09:52,666 INFO L272 TraceCheckUtils]: 26: Hoare triple {826#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {826#false} is VALID [2022-04-07 21:09:52,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {826#false} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {826#false} is VALID [2022-04-07 21:09:52,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#false} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {826#false} is VALID [2022-04-07 21:09:52,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {826#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {826#false} is VALID [2022-04-07 21:09:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 21:09:52,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:09:52,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {826#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {826#false} is VALID [2022-04-07 21:09:52,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#false} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {826#false} is VALID [2022-04-07 21:09:52,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {826#false} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {826#false} is VALID [2022-04-07 21:09:52,799 INFO L272 TraceCheckUtils]: 26: Hoare triple {826#false} [77] L30-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~t~0_12 (+ (* 2 v_main_~a~0_12) 1)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_12, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {826#false} is VALID [2022-04-07 21:09:52,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {904#(<= |main_#t~post5| 1)} [78] L30-1-->L30-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {826#false} is VALID [2022-04-07 21:09:52,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {849#(<= ~counter~0 1)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {904#(<= |main_#t~post5| 1)} is VALID [2022-04-07 21:09:52,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {849#(<= ~counter~0 1)} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,809 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {825#true} {849#(<= ~counter~0 1)} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {825#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {825#true} is VALID [2022-04-07 21:09:52,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {825#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {825#true} is VALID [2022-04-07 21:09:52,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {825#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {825#true} is VALID [2022-04-07 21:09:52,809 INFO L272 TraceCheckUtils]: 18: Hoare triple {849#(<= ~counter~0 1)} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {825#true} is VALID [2022-04-07 21:09:52,810 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {825#true} {849#(<= ~counter~0 1)} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {825#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {825#true} is VALID [2022-04-07 21:09:52,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {825#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {825#true} is VALID [2022-04-07 21:09:52,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {825#true} is VALID [2022-04-07 21:09:52,810 INFO L272 TraceCheckUtils]: 13: Hoare triple {849#(<= ~counter~0 1)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {825#true} is VALID [2022-04-07 21:09:52,811 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {825#true} {849#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {825#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {825#true} is VALID [2022-04-07 21:09:52,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {825#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {825#true} is VALID [2022-04-07 21:09:52,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {825#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {825#true} is VALID [2022-04-07 21:09:52,811 INFO L272 TraceCheckUtils]: 8: Hoare triple {849#(<= ~counter~0 1)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {825#true} is VALID [2022-04-07 21:09:52,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#(<= ~counter~0 1)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#(<= ~counter~0 0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {849#(<= ~counter~0 1)} is VALID [2022-04-07 21:09:52,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#(<= ~counter~0 0)} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#(<= ~counter~0 0)} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#(<= ~counter~0 0)} {825#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#(<= ~counter~0 0)} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {833#(<= ~counter~0 0)} is VALID [2022-04-07 21:09:52,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {825#true} is VALID [2022-04-07 21:09:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 21:09:52,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:09:52,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972122523] [2022-04-07 21:09:52,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 21:09:52,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322888008] [2022-04-07 21:09:52,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322888008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 21:09:52,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 21:09:52,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-07 21:09:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769896401] [2022-04-07 21:09:52,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 21:09:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2022-04-07 21:09:52,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:09:52,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 21:09:52,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:52,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 21:09:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:09:52,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 21:09:52,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:09:52,843 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 21:09:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:52,916 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-07 21:09:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 21:09:52,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2022-04-07 21:09:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:09:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 21:09:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-07 21:09:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 21:09:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-07 21:09:52,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-07 21:09:52,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:52,955 INFO L225 Difference]: With dead ends: 41 [2022-04-07 21:09:52,955 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 21:09:52,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 21:09:52,956 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:09:52,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:09:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 21:09:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-07 21:09:52,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:09:52,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:52,959 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:52,959 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:52,960 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-07 21:09:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-07 21:09:52,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:52,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:52,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 41 states. [2022-04-07 21:09:52,961 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 41 states. [2022-04-07 21:09:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:52,962 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-07 21:09:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-07 21:09:52,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:52,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:52,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:09:52,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:09:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-04-07 21:09:52,964 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-04-07 21:09:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:09:52,964 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-04-07 21:09:52,964 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 21:09:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-07 21:09:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 21:09:52,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:09:52,965 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:52,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 21:09:53,180 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:53,180 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:09:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:09:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1698187712, now seen corresponding path program 1 times [2022-04-07 21:09:53,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:09:53,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888925008] [2022-04-07 21:09:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:09:53,200 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 21:09:53,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660747517] [2022-04-07 21:09:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:53,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:53,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:09:53,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 21:09:53,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 21:09:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:53,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 21:09:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:53,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:09:53,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1175#true} is VALID [2022-04-07 21:09:53,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1195#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 21:09:53,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1195#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 21:09:53,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1195#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 21:09:53,390 INFO L272 TraceCheckUtils]: 8: Hoare triple {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1175#true} is VALID [2022-04-07 21:09:53,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1175#true} is VALID [2022-04-07 21:09:53,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,391 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1175#true} {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1195#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 21:09:53,391 INFO L272 TraceCheckUtils]: 13: Hoare triple {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1175#true} is VALID [2022-04-07 21:09:53,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {1175#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1175#true} is VALID [2022-04-07 21:09:53,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {1175#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,392 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1175#true} {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1195#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 21:09:53,392 INFO L272 TraceCheckUtils]: 18: Hoare triple {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1175#true} is VALID [2022-04-07 21:09:53,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1175#true} is VALID [2022-04-07 21:09:53,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {1175#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,393 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1175#true} {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1195#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 21:09:53,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {1195#(and (= main_~a~0 0) (= main_~t~0 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1250#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-07 21:09:53,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {1250#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1250#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-07 21:09:53,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {1250#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1250#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-07 21:09:53,395 INFO L272 TraceCheckUtils]: 26: Hoare triple {1250#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:09:53,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {1260#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:09:53,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {1264#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1176#false} is VALID [2022-04-07 21:09:53,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {1176#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1176#false} is VALID [2022-04-07 21:09:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 21:09:53,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:09:53,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {1176#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1176#false} is VALID [2022-04-07 21:09:53,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {1264#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1176#false} is VALID [2022-04-07 21:09:53,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {1260#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1264#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:09:53,518 INFO L272 TraceCheckUtils]: 26: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1260#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:09:53,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,520 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1175#true} {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {1175#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1175#true} is VALID [2022-04-07 21:09:53,520 INFO L272 TraceCheckUtils]: 18: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1175#true} is VALID [2022-04-07 21:09:53,521 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1175#true} {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {1175#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {1175#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1175#true} is VALID [2022-04-07 21:09:53,521 INFO L272 TraceCheckUtils]: 13: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1175#true} is VALID [2022-04-07 21:09:53,522 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1175#true} {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1175#true} is VALID [2022-04-07 21:09:53,522 INFO L272 TraceCheckUtils]: 8: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1175#true} is VALID [2022-04-07 21:09:53,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1280#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 21:09:53,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1175#true} is VALID [2022-04-07 21:09:53,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-07 21:09:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 21:09:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:09:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888925008] [2022-04-07 21:09:53,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 21:09:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660747517] [2022-04-07 21:09:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660747517] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 21:09:53,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 21:09:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 21:09:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764441049] [2022-04-07 21:09:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:09:53,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-07 21:09:53,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:09:53,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 21:09:53,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:53,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 21:09:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:09:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 21:09:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 21:09:53,540 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 21:09:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:53,625 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-07 21:09:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 21:09:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-07 21:09:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:09:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 21:09:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-07 21:09:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 21:09:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-07 21:09:53,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-07 21:09:53,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:53,649 INFO L225 Difference]: With dead ends: 45 [2022-04-07 21:09:53,649 INFO L226 Difference]: Without dead ends: 45 [2022-04-07 21:09:53,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 21:09:53,650 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:09:53,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:09:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-07 21:09:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-07 21:09:53,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:09:53,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:53,653 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:53,653 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:53,655 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-07 21:09:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-07 21:09:53,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:53,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:53,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-04-07 21:09:53,656 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-04-07 21:09:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:53,658 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-07 21:09:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-07 21:09:53,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:53,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:53,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:09:53,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:09:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 21:09:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-07 21:09:53,661 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2022-04-07 21:09:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:09:53,662 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-07 21:09:53,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 21:09:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-07 21:09:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 21:09:53,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:09:53,663 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:53,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 21:09:53,876 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:53,876 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:09:53,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:09:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash 888200606, now seen corresponding path program 2 times [2022-04-07 21:09:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:09:53,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446773594] [2022-04-07 21:09:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:09:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:09:53,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 21:09:53,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219102184] [2022-04-07 21:09:53,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 21:09:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:09:53,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 21:09:53,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 21:09:53,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 21:09:53,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 21:09:53,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 21:09:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:09:53,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 21:09:54,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {1543#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1543#true} is VALID [2022-04-07 21:09:54,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1543#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1543#true} {1543#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {1543#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {1543#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:54,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:54,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:54,114 INFO L272 TraceCheckUtils]: 8: Hoare triple {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1543#true} is VALID [2022-04-07 21:09:54,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-07 21:09:54,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {1543#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {1543#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,115 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1543#true} {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:54,115 INFO L272 TraceCheckUtils]: 13: Hoare triple {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1543#true} is VALID [2022-04-07 21:09:54,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-07 21:09:54,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {1543#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {1543#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,116 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1543#true} {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:54,116 INFO L272 TraceCheckUtils]: 18: Hoare triple {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1543#true} is VALID [2022-04-07 21:09:54,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-07 21:09:54,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {1543#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {1543#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,117 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1543#true} {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 21:09:54,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {1563#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-07 21:09:54,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-07 21:09:54,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-07 21:09:54,118 INFO L272 TraceCheckUtils]: 26: Hoare triple {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1543#true} is VALID [2022-04-07 21:09:54,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-07 21:09:54,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {1543#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {1543#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,119 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1543#true} {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-07 21:09:54,119 INFO L272 TraceCheckUtils]: 31: Hoare triple {1618#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1643#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:09:54,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {1643#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1647#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:09:54,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {1647#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1544#false} is VALID [2022-04-07 21:09:54,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {1544#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1544#false} is VALID [2022-04-07 21:09:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 21:09:54,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 21:09:54,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {1544#false} [88] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1544#false} is VALID [2022-04-07 21:09:54,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {1647#(<= 1 __VERIFIER_assert_~cond)} [84] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1544#false} is VALID [2022-04-07 21:09:54,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {1643#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1647#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 21:09:54,265 INFO L272 TraceCheckUtils]: 31: Hoare triple {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1643#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 21:09:54,265 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1543#true} {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-07 21:09:54,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {1543#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {1543#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-07 21:09:54,265 INFO L272 TraceCheckUtils]: 26: Hoare triple {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1543#true} is VALID [2022-04-07 21:09:54,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-07 21:09:54,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-07 21:09:54,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [94] L33-->L30-3: Formula: (and (= v_main_~t~0_8 (+ v_main_~t~0_9 2)) (<= v_main_~s~0_10 v_main_~n~0_5) (= v_main_~s~0_9 (+ v_main_~s~0_10 v_main_~t~0_8)) (= v_main_~a~0_8 (+ v_main_~a~0_9 1))) InVars {main_~t~0=v_main_~t~0_9, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_10, main_~a~0=v_main_~a~0_9} OutVars{main_~t~0=v_main_~t~0_8, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_9, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1663#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-07 21:09:54,281 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1543#true} {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [98] __VERIFIER_assertEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 21:09:54,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {1543#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {1543#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-07 21:09:54,282 INFO L272 TraceCheckUtils]: 18: Hoare triple {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [91] L32-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~t~0_11 v_main_~t~0_11) (* v_main_~t~0_11 2) (* v_main_~s~0_12 (- 4)) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_11, main_~s~0=v_main_~s~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~s~0] {1543#true} is VALID [2022-04-07 21:09:54,282 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1543#true} {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [97] __VERIFIER_assertEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 21:09:54,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {1543#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {1543#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-07 21:09:54,283 INFO L272 TraceCheckUtils]: 13: Hoare triple {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [86] L31-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~s~0_11 (let ((.cse0 (+ 1 v_main_~a~0_11))) (* .cse0 .cse0))) 1 0)) InVars {main_~s~0=v_main_~s~0_11, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~s~0, main_~a~0] {1543#true} is VALID [2022-04-07 21:09:54,283 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1543#true} {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [96] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 21:09:54,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {1543#true} [90] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {1543#true} [85] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {1543#true} [81] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1543#true} is VALID [2022-04-07 21:09:54,283 INFO L272 TraceCheckUtils]: 8: Hoare triple {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [82] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~t~0_10 (+ (* 2 v_main_~a~0_10) 1)) 1 0)) InVars {main_~t~0=v_main_~t~0_10, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0, main_~a~0] {1543#true} is VALID [2022-04-07 21:09:54,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [79] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 21:09:54,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} [76] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 21:09:54,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {1543#true} [73] mainENTRY-->L30-3: Formula: (and (= v_main_~s~0_3 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~t~0_3 1) (= v_main_~a~0_3 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~t~0=v_main_~t~0_3, main_~n~0=v_main_~n~0_1, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~t~0, main_~n~0, main_~s~0, main_~a~0] {1688#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 21:09:54,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {1543#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1543#true} {1543#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {1543#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1543#true} is VALID [2022-04-07 21:09:54,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {1543#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#true} is VALID [2022-04-07 21:09:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 21:09:54,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:09:54,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446773594] [2022-04-07 21:09:54,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 21:09:54,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219102184] [2022-04-07 21:09:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219102184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 21:09:54,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 21:09:54,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 21:09:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317113917] [2022-04-07 21:09:54,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 21:09:54,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-07 21:09:54,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:09:54,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 21:09:54,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:54,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 21:09:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:09:54,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 21:09:54,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 21:09:54,333 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 21:09:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:54,644 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-04-07 21:09:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 21:09:54,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-07 21:09:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:09:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 21:09:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-07 21:09:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 21:09:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-07 21:09:54,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-07 21:09:54,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:09:54,697 INFO L225 Difference]: With dead ends: 50 [2022-04-07 21:09:54,697 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 21:09:54,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-07 21:09:54,698 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:09:54,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:09:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 21:09:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 21:09:54,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:09:54,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 21:09:54,699 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 21:09:54,699 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 21:09:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:54,699 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 21:09:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:09:54,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:54,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:54,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 21:09:54,699 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 21:09:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:09:54,699 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 21:09:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:09:54,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:54,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:09:54,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:09:54,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:09:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 21:09:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 21:09:54,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-07 21:09:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:09:54,700 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 21:09:54,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 21:09:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:09:54,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:09:54,702 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 21:09:54,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 21:09:54,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:09:54,914 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-07 21:09:54,914 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 21:09:54,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:09:54 BasicIcfg [2022-04-07 21:09:54,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 21:09:54,917 INFO L158 Benchmark]: Toolchain (without parser) took 5552.63ms. Allocated memory was 170.9MB in the beginning and 222.3MB in the end (delta: 51.4MB). Free memory was 113.2MB in the beginning and 140.0MB in the end (delta: -26.9MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. [2022-04-07 21:09:54,917 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 21:09:54,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.60ms. Allocated memory was 170.9MB in the beginning and 222.3MB in the end (delta: 51.4MB). Free memory was 113.0MB in the beginning and 193.6MB in the end (delta: -80.6MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-04-07 21:09:54,918 INFO L158 Benchmark]: Boogie Preprocessor took 23.19ms. Allocated memory is still 222.3MB. Free memory was 193.6MB in the beginning and 192.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 21:09:54,918 INFO L158 Benchmark]: RCFGBuilder took 223.49ms. Allocated memory is still 222.3MB. Free memory was 192.5MB in the beginning and 180.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 21:09:54,918 INFO L158 Benchmark]: IcfgTransformer took 17.40ms. Allocated memory is still 222.3MB. Free memory was 180.0MB in the beginning and 178.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 21:09:54,918 INFO L158 Benchmark]: TraceAbstraction took 5080.93ms. Allocated memory is still 222.3MB. Free memory was 178.4MB in the beginning and 140.5MB in the end (delta: 37.8MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. [2022-04-07 21:09:54,919 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.60ms. Allocated memory was 170.9MB in the beginning and 222.3MB in the end (delta: 51.4MB). Free memory was 113.0MB in the beginning and 193.6MB in the end (delta: -80.6MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.19ms. Allocated memory is still 222.3MB. Free memory was 193.6MB in the beginning and 192.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 223.49ms. Allocated memory is still 222.3MB. Free memory was 192.5MB in the beginning and 180.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 17.40ms. Allocated memory is still 222.3MB. Free memory was 180.0MB in the beginning and 178.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5080.93ms. Allocated memory is still 222.3MB. Free memory was 178.4MB in the beginning and 140.5MB in the end (delta: 37.8MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 523 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 215 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 822 SizeOfPredicates, 7 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 149/164 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 21:09:54,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...