/usr/bin/java -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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/reducercommutativity/avg10-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 18:26:49,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 18:26:49,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 18:26:49,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 18:26:49,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 18:26:49,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 18:26:49,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 18:26:49,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 18:26:49,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 18:26:49,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 18:26:49,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 18:26:49,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 18:26:49,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 18:26:49,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 18:26:49,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 18:26:49,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 18:26:49,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 18:26:49,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 18:26:49,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 18:26:49,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 18:26:49,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 18:26:49,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 18:26:49,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 18:26:49,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 18:26:49,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 18:26:49,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 18:26:49,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 18:26:49,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 18:26:49,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 18:26:49,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 18:26:49,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 18:26:49,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 18:26:49,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 18:26:49,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 18:26:49,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 18:26:49,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 18:26:49,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 18:26:49,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 18:26:49,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 18:26:49,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 18:26:49,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 18:26:49,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 18:26:49,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 18:26:49,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 18:26:49,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 18:26:49,427 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 18:26:49,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 18:26:49,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 18:26:49,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 18:26:49,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 18:26:49,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 18:26:49,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 18:26:49,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 18:26:49,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 18:26:49,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 18:26:49,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 18:26:49,429 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 18:26:49,429 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-01-31 18:26:49,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 18:26:49,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 18:26:49,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 18:26:49,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 18:26:49,632 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 18:26:49,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg10-2.i [2022-01-31 18:26:49,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d87ab84c/873f8cf219de424ba1d866216324961a/FLAG7e575b360 [2022-01-31 18:26:50,002 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 18:26:50,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg10-2.i [2022-01-31 18:26:50,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d87ab84c/873f8cf219de424ba1d866216324961a/FLAG7e575b360 [2022-01-31 18:26:50,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d87ab84c/873f8cf219de424ba1d866216324961a [2022-01-31 18:26:50,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 18:26:50,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 18:26:50,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 18:26:50,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 18:26:50,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 18:26:50,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28455e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50, skipping insertion in model container [2022-01-31 18:26:50,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 18:26:50,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 18:26:50,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg10-2.i[1282,1295] [2022-01-31 18:26:50,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 18:26:50,609 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 18:26:50,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg10-2.i[1282,1295] [2022-01-31 18:26:50,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 18:26:50,647 INFO L208 MainTranslator]: Completed translation [2022-01-31 18:26:50,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50 WrapperNode [2022-01-31 18:26:50,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 18:26:50,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 18:26:50,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 18:26:50,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 18:26:50,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 18:26:50,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 18:26:50,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 18:26:50,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 18:26:50,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (1/1) ... [2022-01-31 18:26:50,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 18:26:50,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 18:26:50,721 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-01-31 18:26:50,727 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-01-31 18:26:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 18:26:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 18:26:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 18:26:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2022-01-31 18:26:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 18:26:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 18:26:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 18:26:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 18:26:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 18:26:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 18:26:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 18:26:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 18:26:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 18:26:50,820 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 18:26:50,821 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 18:26:50,923 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 18:26:50,927 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 18:26:50,927 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 18:26:50,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 06:26:50 BoogieIcfgContainer [2022-01-31 18:26:50,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 18:26:50,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 18:26:50,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 18:26:50,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 18:26:50,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 06:26:50" (1/3) ... [2022-01-31 18:26:50,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43faa470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 06:26:50, skipping insertion in model container [2022-01-31 18:26:50,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:50" (2/3) ... [2022-01-31 18:26:50,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43faa470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 06:26:50, skipping insertion in model container [2022-01-31 18:26:50,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 06:26:50" (3/3) ... [2022-01-31 18:26:50,934 INFO L111 eAbstractionObserver]: Analyzing ICFG avg10-2.i [2022-01-31 18:26:50,937 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 18:26:50,937 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 18:26:50,996 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 18:26:51,001 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 18:26:51,001 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 18:26:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 18:26:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 18:26:51,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:51,032 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:51,032 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -56143050, now seen corresponding path program 1 times [2022-01-31 18:26:51,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:51,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [330596348] [2022-01-31 18:26:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:51,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:51,097 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 18:26:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 18:26:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:26:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 18:26:51,205 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [330596348] [2022-01-31 18:26:51,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [330596348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:51,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:51,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 18:26:51,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976377997] [2022-01-31 18:26:51,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:51,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 18:26:51,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:51,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 18:26:51,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 18:26:51,236 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:51,286 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-01-31 18:26:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 18:26:51,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-01-31 18:26:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:51,297 INFO L225 Difference]: With dead ends: 54 [2022-01-31 18:26:51,297 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 18:26:51,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-01-31 18:26:51,301 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:51,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 18:26:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 18:26:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-31 18:26:51,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2022-01-31 18:26:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:51,326 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-31 18:26:51,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-31 18:26:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 18:26:51,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:51,327 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:51,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 18:26:51,327 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:51,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash 809042352, now seen corresponding path program 1 times [2022-01-31 18:26:51,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:51,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1460991597] [2022-01-31 18:26:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:51,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:51,331 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 18:26:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 18:26:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:26:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-31 18:26:51,407 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1460991597] [2022-01-31 18:26:51,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1460991597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:51,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:51,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:26:51,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223744778] [2022-01-31 18:26:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:51,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:26:51,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:51,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:26:51,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:51,409 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:51,521 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-01-31 18:26:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:26:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-01-31 18:26:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:51,523 INFO L225 Difference]: With dead ends: 48 [2022-01-31 18:26:51,523 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 18:26:51,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:51,530 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:51,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 18:26:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-01-31 18:26:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-31 18:26:51,545 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 32 [2022-01-31 18:26:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:51,545 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-31 18:26:51,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-31 18:26:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 18:26:51,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:51,546 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:51,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 18:26:51,546 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1356290064, now seen corresponding path program 1 times [2022-01-31 18:26:51,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:51,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443217689] [2022-01-31 18:26:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:51,561 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:51,561 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:51,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:51,565 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 18:26:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 18:26:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 18:26:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 18:26:51,692 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443217689] [2022-01-31 18:26:51,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1443217689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:51,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:51,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:26:51,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998633673] [2022-01-31 18:26:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:51,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:26:51,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:26:51,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:51,694 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:51,772 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-31 18:26:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:26:51,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-01-31 18:26:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:51,774 INFO L225 Difference]: With dead ends: 50 [2022-01-31 18:26:51,774 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 18:26:51,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:51,780 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:51,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 18:26:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-31 18:26:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-31 18:26:51,794 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 40 [2022-01-31 18:26:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:51,794 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-31 18:26:51,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-31 18:26:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 18:26:51,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:51,795 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:51,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 18:26:51,796 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 232330066, now seen corresponding path program 2 times [2022-01-31 18:26:51,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:51,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141058416] [2022-01-31 18:26:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:51,798 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:51,798 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:51,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:51,799 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:26:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 18:26:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 18:26:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 18:26:51,933 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141058416] [2022-01-31 18:26:51,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2141058416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:51,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:51,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:26:51,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763382072] [2022-01-31 18:26:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:51,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:26:51,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:51,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:26:51,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:51,935 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:52,017 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-01-31 18:26:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:26:52,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-01-31 18:26:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:52,018 INFO L225 Difference]: With dead ends: 51 [2022-01-31 18:26:52,019 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 18:26:52,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:52,023 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:52,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 18:26:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-31 18:26:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 18:26:52,036 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 42 [2022-01-31 18:26:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:52,037 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 18:26:52,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 18:26:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 18:26:52,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:52,040 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:52,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 18:26:52,041 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash 541580336, now seen corresponding path program 3 times [2022-01-31 18:26:52,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:52,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970099925] [2022-01-31 18:26:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:52,047 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:52,048 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:52,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:52,050 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:26:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:26:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 18:26:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:52,142 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:52,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970099925] [2022-01-31 18:26:52,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [970099925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:52,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:52,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 18:26:52,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535523037] [2022-01-31 18:26:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:52,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 18:26:52,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:52,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 18:26:52,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 18:26:52,145 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:52,186 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-31 18:26:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 18:26:52,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-01-31 18:26:52,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:52,187 INFO L225 Difference]: With dead ends: 49 [2022-01-31 18:26:52,187 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 18:26:52,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:52,188 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:52,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 18:26:52,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-31 18:26:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-31 18:26:52,192 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 48 [2022-01-31 18:26:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:52,193 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-31 18:26:52,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-31 18:26:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 18:26:52,194 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:52,194 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:52,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 18:26:52,194 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash 831812782, now seen corresponding path program 1 times [2022-01-31 18:26:52,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:52,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801365985] [2022-01-31 18:26:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:52,197 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:52,197 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:52,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:52,198 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:26:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:26:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 18:26:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:52,247 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:52,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801365985] [2022-01-31 18:26:52,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [801365985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:52,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:52,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:26:52,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694870946] [2022-01-31 18:26:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:52,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:26:52,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:52,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:26:52,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:52,248 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:52,304 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-01-31 18:26:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:26:52,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-01-31 18:26:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:52,305 INFO L225 Difference]: With dead ends: 51 [2022-01-31 18:26:52,305 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 18:26:52,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:52,306 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:52,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 18:26:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 18:26:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-31 18:26:52,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 50 [2022-01-31 18:26:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:52,310 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-31 18:26:52,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-31 18:26:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 18:26:52,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:52,311 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:52,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 18:26:52,311 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash 572319148, now seen corresponding path program 2 times [2022-01-31 18:26:52,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:52,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [38554967] [2022-01-31 18:26:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:52,313 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:52,313 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:52,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:52,314 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:26:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:26:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 18:26:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:52,363 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:52,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [38554967] [2022-01-31 18:26:52,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [38554967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:52,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:52,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:26:52,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742395861] [2022-01-31 18:26:52,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:52,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:26:52,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:26:52,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:26:52,365 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:52,426 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-01-31 18:26:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:26:52,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-01-31 18:26:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:52,427 INFO L225 Difference]: With dead ends: 62 [2022-01-31 18:26:52,427 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 18:26:52,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:26:52,428 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:52,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 18:26:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-01-31 18:26:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-01-31 18:26:52,431 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 52 [2022-01-31 18:26:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:52,431 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-01-31 18:26:52,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-01-31 18:26:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 18:26:52,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:52,432 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:52,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 18:26:52,432 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 179129870, now seen corresponding path program 3 times [2022-01-31 18:26:52,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:52,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786081444] [2022-01-31 18:26:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:52,434 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:52,434 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:52,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:52,435 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 18:26:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 18:26:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 18:26:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:52,494 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:52,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786081444] [2022-01-31 18:26:52,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [786081444] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:52,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:52,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:26:52,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071035344] [2022-01-31 18:26:52,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:52,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:26:52,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:26:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:52,495 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:52,577 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-01-31 18:26:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:26:52,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-01-31 18:26:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:52,578 INFO L225 Difference]: With dead ends: 64 [2022-01-31 18:26:52,578 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 18:26:52,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:26:52,578 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:52,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 18:26:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-01-31 18:26:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-31 18:26:52,582 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2022-01-31 18:26:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:52,582 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-31 18:26:52,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-31 18:26:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 18:26:52,583 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:52,583 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:52,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 18:26:52,583 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 281355760, now seen corresponding path program 4 times [2022-01-31 18:26:52,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1887945291] [2022-01-31 18:26:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:52,585 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:52,585 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:52,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:52,586 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 18:26:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 18:26:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 18:26:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:52,652 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:52,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1887945291] [2022-01-31 18:26:52,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1887945291] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:52,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:52,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:26:52,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386163657] [2022-01-31 18:26:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:52,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:26:52,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:26:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:26:52,653 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:52,736 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-01-31 18:26:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:26:52,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-01-31 18:26:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:52,737 INFO L225 Difference]: With dead ends: 66 [2022-01-31 18:26:52,737 INFO L226 Difference]: Without dead ends: 42 [2022-01-31 18:26:52,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:26:52,738 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:52,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-31 18:26:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-01-31 18:26:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-01-31 18:26:52,742 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 56 [2022-01-31 18:26:52,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:52,742 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-01-31 18:26:52,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-01-31 18:26:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 18:26:52,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:52,743 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:52,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 18:26:52,743 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:52,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -263811758, now seen corresponding path program 5 times [2022-01-31 18:26:52,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1297227579] [2022-01-31 18:26:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:52,745 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:52,745 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:52,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:52,746 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:26:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 18:26:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 18:26:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:52,827 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:52,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1297227579] [2022-01-31 18:26:52,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1297227579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:52,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:52,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:26:52,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916150450] [2022-01-31 18:26:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:52,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:26:52,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:52,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:26:52,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:26:52,828 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:52,909 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-01-31 18:26:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:26:52,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-01-31 18:26:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:52,910 INFO L225 Difference]: With dead ends: 68 [2022-01-31 18:26:52,910 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 18:26:52,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:26:52,910 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:52,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 32 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 18:26:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 18:26:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-01-31 18:26:52,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 58 [2022-01-31 18:26:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:52,914 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-01-31 18:26:52,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-01-31 18:26:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 18:26:52,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:52,915 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:52,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 18:26:52,915 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -183786444, now seen corresponding path program 6 times [2022-01-31 18:26:52,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [573663231] [2022-01-31 18:26:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:52,917 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:52,917 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:52,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:52,918 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:52,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 18:26:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 18:26:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 18:26:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:53,010 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:53,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [573663231] [2022-01-31 18:26:53,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [573663231] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:53,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:53,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 18:26:53,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074563114] [2022-01-31 18:26:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:53,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 18:26:53,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:53,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 18:26:53,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-01-31 18:26:53,011 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:53,116 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-01-31 18:26:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 18:26:53,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-01-31 18:26:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:53,117 INFO L225 Difference]: With dead ends: 70 [2022-01-31 18:26:53,117 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 18:26:53,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:26:53,120 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:53,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 18:26:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-01-31 18:26:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-01-31 18:26:53,134 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 60 [2022-01-31 18:26:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:53,134 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-01-31 18:26:53,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-01-31 18:26:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 18:26:53,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:53,136 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:53,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 18:26:53,136 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:53,136 INFO L85 PathProgramCache]: Analyzing trace with hash -588871018, now seen corresponding path program 7 times [2022-01-31 18:26:53,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:53,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864613798] [2022-01-31 18:26:53,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:53,138 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:53,138 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:53,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:53,140 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 18:26:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 18:26:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 18:26:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:53,227 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:53,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864613798] [2022-01-31 18:26:53,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [864613798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:53,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:53,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 18:26:53,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234762910] [2022-01-31 18:26:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:53,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 18:26:53,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:53,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 18:26:53,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:26:53,229 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:53,359 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-01-31 18:26:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 18:26:53,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-01-31 18:26:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:53,361 INFO L225 Difference]: With dead ends: 72 [2022-01-31 18:26:53,361 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 18:26:53,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:26:53,362 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:53,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 52 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 18:26:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-01-31 18:26:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-01-31 18:26:53,367 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 62 [2022-01-31 18:26:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:53,367 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-01-31 18:26:53,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-01-31 18:26:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 18:26:53,367 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:53,367 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:53,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 18:26:53,367 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash 966877304, now seen corresponding path program 8 times [2022-01-31 18:26:53,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:53,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342830981] [2022-01-31 18:26:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:53,369 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:53,369 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:53,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:53,370 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:26:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:26:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 18:26:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:53,452 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1342830981] [2022-01-31 18:26:53,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1342830981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:53,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:53,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 18:26:53,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427188780] [2022-01-31 18:26:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:53,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 18:26:53,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 18:26:53,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-01-31 18:26:53,453 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:53,568 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-01-31 18:26:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 18:26:53,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-01-31 18:26:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:53,568 INFO L225 Difference]: With dead ends: 74 [2022-01-31 18:26:53,569 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 18:26:53,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:26:53,569 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:53,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 37 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 18:26:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-01-31 18:26:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 18:26:53,573 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 64 [2022-01-31 18:26:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:53,573 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 18:26:53,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 18:26:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 18:26:53,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:53,574 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:53,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 18:26:53,574 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:53,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1392395738, now seen corresponding path program 9 times [2022-01-31 18:26:53,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:53,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351400271] [2022-01-31 18:26:53,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:53,575 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:53,576 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:53,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:53,576 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 18:26:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 18:26:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 18:26:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:26:53,669 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:53,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [351400271] [2022-01-31 18:26:53,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [351400271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:53,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:53,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 18:26:53,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284942169] [2022-01-31 18:26:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:53,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 18:26:53,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:53,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 18:26:53,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:26:53,670 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:53,818 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-01-31 18:26:53,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 18:26:53,819 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2022-01-31 18:26:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:53,819 INFO L225 Difference]: With dead ends: 75 [2022-01-31 18:26:53,819 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 18:26:53,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2022-01-31 18:26:53,820 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:53,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 42 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 18:26:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-01-31 18:26:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-01-31 18:26:53,824 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 66 [2022-01-31 18:26:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:53,824 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-01-31 18:26:53,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-01-31 18:26:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 18:26:53,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:53,824 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:53,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 18:26:53,824 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:53,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2001249604, now seen corresponding path program 10 times [2022-01-31 18:26:53,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:53,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [445105184] [2022-01-31 18:26:53,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:53,826 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:53,826 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:53,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:53,827 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 18:26:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 18:26:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 18:26:53,872 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:53,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [445105184] [2022-01-31 18:26:53,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [445105184] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:53,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:53,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:26:53,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118319841] [2022-01-31 18:26:53,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:53,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:26:53,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:26:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:26:53,873 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:53,917 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-01-31 18:26:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:26:53,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2022-01-31 18:26:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:53,917 INFO L225 Difference]: With dead ends: 77 [2022-01-31 18:26:53,918 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 18:26:53,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:26:53,918 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:53,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 18:26:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-01-31 18:26:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-01-31 18:26:53,922 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 68 [2022-01-31 18:26:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:53,922 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-01-31 18:26:53,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-01-31 18:26:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-31 18:26:53,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:53,922 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:53,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 18:26:53,923 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:53,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1326557722, now seen corresponding path program 11 times [2022-01-31 18:26:53,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:53,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1639128969] [2022-01-31 18:26:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:53,924 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:53,924 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:53,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:53,925 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-31 18:26:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 18:26:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 18:26:53,974 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1639128969] [2022-01-31 18:26:53,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1639128969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:53,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:53,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:26:53,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899228355] [2022-01-31 18:26:53,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:53,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:26:53,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:26:53,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:53,975 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:54,035 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-01-31 18:26:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:26:54,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2022-01-31 18:26:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:54,036 INFO L225 Difference]: With dead ends: 81 [2022-01-31 18:26:54,036 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 18:26:54,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:26:54,036 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:54,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 18:26:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-01-31 18:26:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-01-31 18:26:54,040 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 74 [2022-01-31 18:26:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:54,040 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-01-31 18:26:54,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-01-31 18:26:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 18:26:54,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:54,041 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:54,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 18:26:54,041 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash 775666424, now seen corresponding path program 12 times [2022-01-31 18:26:54,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:54,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102954337] [2022-01-31 18:26:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:54,042 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:54,043 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:54,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:54,043 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 18:26:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 18:26:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 18:26:54,099 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:54,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102954337] [2022-01-31 18:26:54,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2102954337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:54,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:54,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:26:54,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980479600] [2022-01-31 18:26:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:54,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:26:54,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:54,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:26:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:26:54,100 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:54,162 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-01-31 18:26:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:26:54,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2022-01-31 18:26:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:54,163 INFO L225 Difference]: With dead ends: 85 [2022-01-31 18:26:54,163 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 18:26:54,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:26:54,163 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:54,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 18:26:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-01-31 18:26:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-01-31 18:26:54,167 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 80 [2022-01-31 18:26:54,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:54,167 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-01-31 18:26:54,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-01-31 18:26:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-31 18:26:54,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:54,168 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:54,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 18:26:54,168 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1906175318, now seen corresponding path program 13 times [2022-01-31 18:26:54,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:54,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [987187874] [2022-01-31 18:26:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:54,170 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:54,170 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:54,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:54,171 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 18:26:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-31 18:26:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 18:26:54,242 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:54,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [987187874] [2022-01-31 18:26:54,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [987187874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:54,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:54,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:26:54,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221343729] [2022-01-31 18:26:54,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:54,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:26:54,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:26:54,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:26:54,243 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:54,342 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-01-31 18:26:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:26:54,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2022-01-31 18:26:54,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:54,343 INFO L225 Difference]: With dead ends: 89 [2022-01-31 18:26:54,343 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 18:26:54,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:26:54,344 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:54,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 18:26:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-01-31 18:26:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-01-31 18:26:54,348 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 86 [2022-01-31 18:26:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:54,348 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-01-31 18:26:54,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-01-31 18:26:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 18:26:54,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:54,349 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:54,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 18:26:54,349 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:54,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1355243212, now seen corresponding path program 14 times [2022-01-31 18:26:54,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:54,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1130152437] [2022-01-31 18:26:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:54,351 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:54,351 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:54,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:54,352 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 18:26:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 18:26:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-31 18:26:54,445 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:54,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1130152437] [2022-01-31 18:26:54,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1130152437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:54,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:54,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 18:26:54,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95973627] [2022-01-31 18:26:54,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:54,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 18:26:54,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:54,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 18:26:54,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-01-31 18:26:54,447 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:54,541 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-01-31 18:26:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 18:26:54,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 92 [2022-01-31 18:26:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:54,542 INFO L225 Difference]: With dead ends: 93 [2022-01-31 18:26:54,542 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 18:26:54,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:26:54,543 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:54,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 18:26:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-01-31 18:26:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-01-31 18:26:54,547 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 92 [2022-01-31 18:26:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:54,547 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-01-31 18:26:54,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-01-31 18:26:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-01-31 18:26:54,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:54,548 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:54,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 18:26:54,548 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1034172050, now seen corresponding path program 15 times [2022-01-31 18:26:54,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:54,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587539643] [2022-01-31 18:26:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:54,549 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:54,550 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:54,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:54,551 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 18:26:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-31 18:26:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 18:26:54,637 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:54,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587539643] [2022-01-31 18:26:54,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1587539643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:54,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:54,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 18:26:54,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379132934] [2022-01-31 18:26:54,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:54,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 18:26:54,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:54,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 18:26:54,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:26:54,638 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:54,748 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-01-31 18:26:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 18:26:54,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2022-01-31 18:26:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:54,749 INFO L225 Difference]: With dead ends: 97 [2022-01-31 18:26:54,749 INFO L226 Difference]: Without dead ends: 64 [2022-01-31 18:26:54,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:26:54,749 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:54,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-31 18:26:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-01-31 18:26:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-01-31 18:26:54,754 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 98 [2022-01-31 18:26:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:54,754 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-01-31 18:26:54,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-01-31 18:26:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 18:26:54,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:54,754 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:54,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 18:26:54,755 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash 705760624, now seen corresponding path program 16 times [2022-01-31 18:26:54,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:54,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644697943] [2022-01-31 18:26:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:54,756 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:54,756 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:54,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:54,757 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 18:26:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 18:26:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-31 18:26:54,854 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644697943] [2022-01-31 18:26:54,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1644697943] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:54,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:54,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 18:26:54,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485961088] [2022-01-31 18:26:54,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:54,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 18:26:54,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:54,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 18:26:54,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-01-31 18:26:54,855 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:54,976 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-01-31 18:26:54,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 18:26:54,976 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 104 [2022-01-31 18:26:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:54,977 INFO L225 Difference]: With dead ends: 101 [2022-01-31 18:26:54,977 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 18:26:54,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:26:54,978 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:54,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 47 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 18:26:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-01-31 18:26:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-01-31 18:26:54,982 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 104 [2022-01-31 18:26:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:54,982 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-01-31 18:26:54,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-01-31 18:26:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-31 18:26:54,983 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:54,983 INFO L514 BasicCegarLoop]: trace histogram [27, 27, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:54,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 18:26:54,983 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1371044402, now seen corresponding path program 17 times [2022-01-31 18:26:54,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:54,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [274366116] [2022-01-31 18:26:54,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:54,984 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:54,985 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:54,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:54,986 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 18:26:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 18:26:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 18:26:55,088 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:55,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [274366116] [2022-01-31 18:26:55,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [274366116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:55,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:55,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 18:26:55,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690876303] [2022-01-31 18:26:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:55,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 18:26:55,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:55,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 18:26:55,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:26:55,089 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:55,218 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-01-31 18:26:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 18:26:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2022-01-31 18:26:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:55,219 INFO L225 Difference]: With dead ends: 104 [2022-01-31 18:26:55,219 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 18:26:55,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2022-01-31 18:26:55,220 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:55,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 42 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 18:26:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-31 18:26:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-01-31 18:26:55,243 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 110 [2022-01-31 18:26:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:55,243 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-01-31 18:26:55,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-01-31 18:26:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-31 18:26:55,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:55,244 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:55,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 18:26:55,244 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:55,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash 648544172, now seen corresponding path program 18 times [2022-01-31 18:26:55,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:55,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174690281] [2022-01-31 18:26:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:55,246 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:55,246 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:55,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:55,247 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:26:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 18:26:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 18:26:55,303 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:55,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174690281] [2022-01-31 18:26:55,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [174690281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:55,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:55,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:26:55,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083753594] [2022-01-31 18:26:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:55,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:26:55,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:26:55,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:26:55,304 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:55,351 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-01-31 18:26:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:26:55,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2022-01-31 18:26:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:55,352 INFO L225 Difference]: With dead ends: 101 [2022-01-31 18:26:55,352 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 18:26:55,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:26:55,353 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:55,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 18:26:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-01-31 18:26:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-01-31 18:26:55,358 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 116 [2022-01-31 18:26:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:55,359 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-01-31 18:26:55,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-01-31 18:26:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-31 18:26:55,359 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:55,359 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:55,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 18:26:55,360 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash -862131926, now seen corresponding path program 19 times [2022-01-31 18:26:55,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:55,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1009057021] [2022-01-31 18:26:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:55,361 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:55,362 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:55,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:55,363 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:26:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-01-31 18:26:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 18:26:55,421 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1009057021] [2022-01-31 18:26:55,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1009057021] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:55,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:55,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:26:55,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472661670] [2022-01-31 18:26:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:55,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:26:55,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:26:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:55,423 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:55,476 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-01-31 18:26:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:26:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 118 [2022-01-31 18:26:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:55,477 INFO L225 Difference]: With dead ends: 103 [2022-01-31 18:26:55,477 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 18:26:55,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:26:55,478 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:55,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 18:26:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-01-31 18:26:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-01-31 18:26:55,484 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 118 [2022-01-31 18:26:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:55,484 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-01-31 18:26:55,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-01-31 18:26:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 18:26:55,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:55,485 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:55,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 18:26:55,485 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -922916056, now seen corresponding path program 20 times [2022-01-31 18:26:55,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:55,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15987872] [2022-01-31 18:26:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:55,486 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:55,487 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:55,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:55,488 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:26:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 18:26:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 18:26:55,548 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:55,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15987872] [2022-01-31 18:26:55,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [15987872] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:55,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:55,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:26:55,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614246700] [2022-01-31 18:26:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:55,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:26:55,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:26:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:26:55,549 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:55,612 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-01-31 18:26:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:26:55,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 120 [2022-01-31 18:26:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:55,613 INFO L225 Difference]: With dead ends: 105 [2022-01-31 18:26:55,613 INFO L226 Difference]: Without dead ends: 74 [2022-01-31 18:26:55,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-01-31 18:26:55,613 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:55,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-31 18:26:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-01-31 18:26:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-01-31 18:26:55,618 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 120 [2022-01-31 18:26:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:55,619 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-01-31 18:26:55,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-01-31 18:26:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-31 18:26:55,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:55,620 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:55,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 18:26:55,620 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:55,620 INFO L85 PathProgramCache]: Analyzing trace with hash 793077158, now seen corresponding path program 21 times [2022-01-31 18:26:55,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:55,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289735660] [2022-01-31 18:26:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:55,621 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:55,621 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:55,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:55,623 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:26:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 18:26:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 18:26:55,689 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:55,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289735660] [2022-01-31 18:26:55,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [289735660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:55,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:55,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:26:55,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623717197] [2022-01-31 18:26:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:55,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:26:55,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:26:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:26:55,690 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:55,776 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-01-31 18:26:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:26:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2022-01-31 18:26:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:55,777 INFO L225 Difference]: With dead ends: 107 [2022-01-31 18:26:55,777 INFO L226 Difference]: Without dead ends: 76 [2022-01-31 18:26:55,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:26:55,777 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:55,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-31 18:26:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-01-31 18:26:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-01-31 18:26:55,782 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 122 [2022-01-31 18:26:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:55,782 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-01-31 18:26:55,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-01-31 18:26:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-31 18:26:55,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:55,783 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:55,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 18:26:55,783 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash 595114148, now seen corresponding path program 22 times [2022-01-31 18:26:55,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:55,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1003178394] [2022-01-31 18:26:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:55,785 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:55,785 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:55,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:55,786 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:26:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 18:26:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 18:26:55,872 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1003178394] [2022-01-31 18:26:55,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1003178394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:55,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:55,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 18:26:55,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128011363] [2022-01-31 18:26:55,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:55,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 18:26:55,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 18:26:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-01-31 18:26:55,875 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:56,004 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-01-31 18:26:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 18:26:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 124 [2022-01-31 18:26:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:56,008 INFO L225 Difference]: With dead ends: 109 [2022-01-31 18:26:56,008 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 18:26:56,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-01-31 18:26:56,009 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:56,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:26:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 18:26:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-01-31 18:26:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 69 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-01-31 18:26:56,037 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 124 [2022-01-31 18:26:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:56,037 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-01-31 18:26:56,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-01-31 18:26:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-31 18:26:56,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:56,038 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:56,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 18:26:56,039 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash -668777438, now seen corresponding path program 23 times [2022-01-31 18:26:56,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:56,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921823357] [2022-01-31 18:26:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:56,040 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:56,041 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:56,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:56,042 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:26:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-31 18:26:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 18:26:56,145 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:56,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921823357] [2022-01-31 18:26:56,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1921823357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:56,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:56,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 18:26:56,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876320569] [2022-01-31 18:26:56,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:56,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 18:26:56,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 18:26:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-01-31 18:26:56,146 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:56,211 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-01-31 18:26:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 18:26:56,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 126 [2022-01-31 18:26:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:56,212 INFO L225 Difference]: With dead ends: 111 [2022-01-31 18:26:56,212 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 18:26:56,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-01-31 18:26:56,213 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:56,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 37 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 18:26:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-01-31 18:26:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-01-31 18:26:56,219 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 126 [2022-01-31 18:26:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:56,219 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-01-31 18:26:56,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-01-31 18:26:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-31 18:26:56,219 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:56,220 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:56,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 18:26:56,220 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 207153184, now seen corresponding path program 24 times [2022-01-31 18:26:56,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592835491] [2022-01-31 18:26:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:56,221 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:56,221 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:56,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:56,222 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:26:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:26:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-31 18:26:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 18:26:56,311 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:56,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592835491] [2022-01-31 18:26:56,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1592835491] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:56,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:56,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 18:26:56,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436816719] [2022-01-31 18:26:56,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:56,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 18:26:56,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 18:26:56,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-01-31 18:26:56,312 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:56,424 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-01-31 18:26:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 18:26:56,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 128 [2022-01-31 18:26:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:56,424 INFO L225 Difference]: With dead ends: 112 [2022-01-31 18:26:56,425 INFO L226 Difference]: Without dead ends: 81 [2022-01-31 18:26:56,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-01-31 18:26:56,425 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:56,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 42 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-31 18:26:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-01-31 18:26:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:26:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-01-31 18:26:56,430 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 128 [2022-01-31 18:26:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:56,431 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-01-31 18:26:56,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:26:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-01-31 18:26:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-31 18:26:56,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:56,431 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:26:56,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 18:26:56,432 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash 162890910, now seen corresponding path program 25 times [2022-01-31 18:26:56,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:56,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1135046986] [2022-01-31 18:26:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:56,433 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:26:56,433 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:56,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:56,434 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:27:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:27:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:27:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:27:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:28:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 18:28:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:32:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 46 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 18:32:12,214 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:32:12,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1135046986] [2022-01-31 18:32:12,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1135046986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:32:12,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:32:12,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2022-01-31 18:32:12,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059721098] [2022-01-31 18:32:12,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:32:12,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-01-31 18:32:12,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:32:12,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-01-31 18:32:12,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=10053, Unknown=0, NotChecked=0, Total=10302 [2022-01-31 18:32:12,219 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 102 states, 100 states have (on average 1.12) internal successors, (112), 98 states have internal predecessors, (112), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:33:02,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 18:33:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:33:16,681 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2022-01-31 18:33:16,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-31 18:33:16,682 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 1.12) internal successors, (112), 98 states have internal predecessors, (112), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 130 [2022-01-31 18:33:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:33:16,684 INFO L225 Difference]: With dead ends: 127 [2022-01-31 18:33:16,684 INFO L226 Difference]: Without dead ends: 123 [2022-01-31 18:33:16,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5598 ImplicationChecksByTransitivity, 75.8s TimeCoverageRelationStatistics Valid=628, Invalid=27761, Unknown=3, NotChecked=0, Total=28392 [2022-01-31 18:33:16,690 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 6780 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 6887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 6780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:33:16,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 336 Invalid, 6887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 6780 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-01-31 18:33:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-31 18:33:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2022-01-31 18:33:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 103 states have internal predecessors, (107), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2022-01-31 18:33:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2022-01-31 18:33:16,782 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 130 [2022-01-31 18:33:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:33:16,782 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2022-01-31 18:33:16,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 1.12) internal successors, (112), 98 states have internal predecessors, (112), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:33:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-01-31 18:33:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 18:33:16,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:33:16,783 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:33:16,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 18:33:16,784 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:33:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:33:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 266105148, now seen corresponding path program 26 times [2022-01-31 18:33:16,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:33:16,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [843222033] [2022-01-31 18:33:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:33:16,786 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:33:16,786 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:33:16,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:33:16,791 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:33:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:33:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 18:33:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:16,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 18:33:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-31 18:33:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 18:33:16,946 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:33:16,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [843222033] [2022-01-31 18:33:16,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [843222033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:33:16,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:33:16,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 18:33:16,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874588249] [2022-01-31 18:33:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:33:16,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 18:33:16,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:33:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 18:33:16,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-01-31 18:33:16,947 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 18:33:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:33:17,173 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2022-01-31 18:33:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 18:33:17,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 132 [2022-01-31 18:33:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:33:17,174 INFO L225 Difference]: With dead ends: 166 [2022-01-31 18:33:17,174 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 18:33:17,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2022-01-31 18:33:17,176 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 18:33:17,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 41 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 18:33:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 18:33:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-01-31 18:33:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 states have internal predecessors, (77), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 18:33:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-01-31 18:33:17,189 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 132 [2022-01-31 18:33:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:33:17,189 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-01-31 18:33:17,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 18:33:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-01-31 18:33:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-31 18:33:17,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:33:17,190 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 11, 11, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 18:33:17,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 18:33:17,190 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:33:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:33:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1881765504, now seen corresponding path program 27 times [2022-01-31 18:33:17,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:33:17,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [859114429] [2022-01-31 18:33:17,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:33:17,192 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:33:17,192 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:33:17,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:33:17,194 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:33:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:17,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:33:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:17,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 18:33:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:17,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 18:33:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 18:33:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:33:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-31 18:33:17,305 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:33:17,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [859114429] [2022-01-31 18:33:17,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [859114429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:33:17,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:33:17,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 18:33:17,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128003755] [2022-01-31 18:33:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:33:17,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 18:33:17,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:33:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 18:33:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-01-31 18:33:17,306 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:33:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:33:17,413 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-01-31 18:33:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 18:33:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 132 [2022-01-31 18:33:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:33:17,413 INFO L225 Difference]: With dead ends: 83 [2022-01-31 18:33:17,413 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 18:33:17,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=204, Invalid=396, Unknown=0, NotChecked=0, Total=600 [2022-01-31 18:33:17,414 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:33:17,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:33:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 18:33:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 18:33:17,414 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-01-31 18:33:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 18:33:17,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2022-01-31 18:33:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:33:17,415 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 18:33:17,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 18:33:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 18:33:17,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 18:33:17,418 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 18:33:17,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 18:33:17,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 18:33:42,556 WARN L228 SmtUtils]: Spent 21.68s on a formula simplification. DAG size of input: 503 DAG size of output: 487 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 18:36:00,735 WARN L228 SmtUtils]: Spent 2.30m on a formula simplification. DAG size of input: 706 DAG size of output: 695 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 18:36:00,748 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 18:36:00,748 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 18:36:00,748 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 18:36:00,748 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 26 53) the Hoare annotation is: true [2022-01-31 18:36:00,748 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: false [2022-01-31 18:36:00,748 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 26 53) the Hoare annotation is: true [2022-01-31 18:36:00,749 INFO L854 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (let ((.cse14 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse1 (select .cse14 12)) (.cse2 (select .cse14 (+ |main_~#x~0.offset| 4))) (.cse3 (select .cse14 (+ |main_~#x~0.offset| 16))) (.cse4 (select .cse14 (+ |main_~#x~0.offset| 32))) (.cse5 (select .cse14 (+ |main_~#x~0.offset| 20))) (.cse6 (select .cse14 (+ |main_~#x~0.offset| 28))) (.cse7 (select .cse14 (+ |main_~#x~0.offset| 8))) (.cse8 (select .cse14 (+ |main_~#x~0.offset| 24))) (.cse9 (select .cse14 |main_~#x~0.offset|)) (.cse10 (select .cse14 (+ |main_~#x~0.offset| 36)))) (let ((.cse13 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse15 (div .cse13 10))) (let ((.cse0 (<= 0 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 21474836480 .cse10))) (.cse11 (= |main_#t~ret5| .cse15)) (.cse12 (<= .cse13 21474836470))) (or (and .cse0 (or (<= (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 1) 0) (and .cse11 .cse12)) (<= .cse13 (+ (* 10 (div (+ (- 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (select .cse14 (+ |main_~#x~0.offset| 12)) .cse8 .cse9 .cse10) 10)) 9)) (or (<= 0 .cse13) (= (+ .cse15 1) |main_#t~ret5|))) (let ((.cse17 (+ .cse1 .cse2 .cse3 .cse4 .cse5 9 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse16 (div .cse17 10))) (and .cse0 (or .cse11 (and (< (div (+ .cse1 .cse2 (- 42949672951) .cse3 (* (- 42949672960) (div (+ .cse1 .cse2 (* |main_#t~ret5| (- 10)) .cse3 (- 42949672960) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) 42949672960)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) 10) .cse15) (<= .cse16 (div (+ .cse1 .cse2 .cse3 (- 42949672960) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (* (- 42949672960) (div .cse17 42949672960))) 10)))) (<= (* .cse16 10) .cse13) .cse12))))))))) (= |main_~#x~0.offset| 0)) [2022-01-31 18:36:00,750 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 36) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse3 (select .cse12 (+ |main_~#x~0.offset| 28))) (.cse6 (select .cse12 (+ |main_~#x~0.offset| 24))) (.cse9 (div (* (- 1) |main_~#x~0.offset|) 4)) (.cse10 (= |main_~#x~0.offset| 0)) (.cse0 (select .cse12 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse12 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse12 (+ |main_~#x~0.offset| 20))) (.cse4 (select .cse12 (+ |main_~#x~0.offset| 8))) (.cse5 (select .cse12 (+ |main_~#x~0.offset| 12))) (.cse7 (select .cse12 0)) (.cse8 (select .cse12 (+ |main_~#x~0.offset| (* main_~i~1 4))))) (or (and (<= main_~i~1 8) (<= 0 (+ .cse0 .cse1 .cse2 .cse3 .cse4 19327352832 .cse5 .cse6 .cse7 .cse8)) (<= (+ 8 .cse9) main_~i~1) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) 17179869176) .cse10 (<= 0 (+ 17179869184 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) 19327352823)) (and (<= (+ .cse0 .cse4 .cse5 .cse7 .cse8) 10737418235) (<= 0 (+ .cse0 10737418240 .cse4 .cse5 .cse7 .cse8)) (<= (+ 4 .cse9) main_~i~1) .cse10 (<= (+ .cse0 .cse4 .cse5 .cse7) 8589934588) (<= main_~i~1 4) (<= 0 (+ .cse0 8589934592 .cse4 .cse5 .cse7))) (let ((.cse11 (select .cse12 (+ |main_~#x~0.offset| 32)))) (and (<= (+ .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) 21474836470) (<= 0 (+ .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 19327352832 .cse5 .cse6 .cse7)) (<= (+ .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) 19327352823) (<= main_~i~1 9) (<= 0 (+ .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 21474836480 .cse8)) (<= 9 main_~i~1) .cse10)) (and (<= (+ .cse0 .cse7 .cse8) 6442450941) (<= (+ .cse0 .cse7) 4294967294) (<= main_~i~1 2) (<= 0 (+ .cse0 6442450944 .cse7 .cse8)) .cse10 (<= 0 (+ .cse0 4294967296 .cse7)) (<= 2 main_~i~1)) (and (<= 0 (+ 4294967296 .cse7 .cse8)) (<= (+ .cse7 .cse8) 4294967294) (<= main_~i~1 1) (<= 0 (+ .cse7 2147483648)) (<= (+ 1 .cse9) main_~i~1) .cse10 (<= .cse7 2147483647)) (and (<= .cse8 2147483647) (<= 0 (+ 2147483648 .cse8)) .cse10 (= main_~i~1 0)) (and (<= main_~i~1 5) (<= 0 (+ .cse0 .cse1 10737418240 .cse4 .cse5 .cse7)) (<= (+ .cse0 .cse1 .cse4 .cse5 .cse7 .cse8) 12884901882) (<= (+ 5 .cse9) main_~i~1) .cse10 (<= (+ .cse0 .cse1 .cse4 .cse5 .cse7) 10737418235) (<= 0 (+ .cse0 .cse1 .cse4 .cse5 12884901888 .cse7 .cse8))) (and (<= main_~i~1 7) (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) 15032385529) (<= 0 (+ 17179869184 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8)) (<= 0 (+ .cse0 .cse1 15032385536 .cse2 .cse4 .cse5 .cse6 .cse7)) (<= (+ 7 .cse9) main_~i~1) (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) 17179869176) .cse10) (and (<= (+ .cse0 .cse4 .cse7) 6442450941) (<= (+ .cse0 .cse4 .cse7 .cse8) 8589934588) (<= main_~i~1 3) (<= 0 (+ .cse0 8589934592 .cse4 .cse7 .cse8)) .cse10 (<= 0 (+ .cse0 .cse4 6442450944 .cse7)) (<= 3 main_~i~1)) (and (<= 0 (+ .cse0 .cse1 .cse2 .cse4 .cse5 12884901888 .cse7)) (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse7) 12884901882) (<= (+ 6 .cse9) main_~i~1) .cse10 (<= (+ .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8) 15032385529) (<= 0 (+ .cse0 .cse1 15032385536 .cse2 .cse4 .cse5 .cse7 .cse8)) (<= main_~i~1 6))))) [2022-01-31 18:36:00,750 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) the Hoare annotation is: false [2022-01-31 18:36:00,750 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse7 (select .cse12 (+ |main_~#x~0.offset| 32))) (.cse9 (select .cse12 (+ |main_~#x~0.offset| 28))) (.cse6 (select .cse12 (+ |main_~#x~0.offset| 16))) (.cse8 (select .cse12 (+ |main_~#x~0.offset| 20))) (.cse4 (select .cse12 (+ |main_~#x~0.offset| 12))) (.cse10 (select .cse12 (+ |main_~#x~0.offset| 24))) (.cse0 (div (* (- 1) |main_~#x~0.offset|) 4)) (.cse1 (= |main_~#x~0.offset| 0)) (.cse2 (select .cse12 (+ |main_~#x~0.offset| 4))) (.cse3 (select .cse12 (+ |main_~#x~0.offset| 8))) (.cse5 (select .cse12 0))) (or (and (<= (+ 4 .cse0) main_~i~1) .cse1 (<= (+ .cse2 .cse3 .cse4 .cse5) 8589934588) (<= main_~i~1 4) (<= 0 (+ .cse2 8589934592 .cse3 .cse4 .cse5))) (let ((.cse11 (select .cse12 (+ |main_~#x~0.offset| 36)))) (and (<= (+ .cse2 .cse6 .cse7 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5 .cse11) 21474836470) (<= 10 main_~i~1) (<= 0 (+ .cse2 .cse6 .cse7 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5 21474836480 .cse11)) .cse1)) (and .cse1 (= main_~i~1 0)) (and (<= main_~i~1 1) (<= 0 (+ .cse5 2147483648)) (<= (+ 1 .cse0) main_~i~1) .cse1 (<= .cse5 2147483647)) (and (<= (+ .cse2 .cse5) 4294967294) (<= main_~i~1 2) .cse1 (<= 0 (+ .cse2 4294967296 .cse5)) (<= 2 main_~i~1)) (and (<= main_~i~1 8) (<= (+ 8 .cse0) main_~i~1) (<= (+ .cse2 .cse6 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5) 17179869176) .cse1 (<= 0 (+ 17179869184 .cse2 .cse6 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5))) (and (<= main_~i~1 5) (<= 0 (+ .cse2 .cse6 10737418240 .cse3 .cse4 .cse5)) (<= (+ 5 .cse0) main_~i~1) .cse1 (<= (+ .cse2 .cse6 .cse3 .cse4 .cse5) 10737418235)) (and (<= 0 (+ .cse2 .cse6 .cse8 .cse3 .cse4 12884901888 .cse5)) (<= (+ .cse2 .cse6 .cse8 .cse3 .cse4 .cse5) 12884901882) (<= (+ 6 .cse0) main_~i~1) .cse1 (<= main_~i~1 6)) (and (<= 0 (+ .cse2 .cse6 .cse7 .cse8 .cse9 .cse3 19327352832 .cse4 .cse10 .cse5)) (<= (+ .cse2 .cse6 .cse7 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5) 19327352823) (<= main_~i~1 9) (<= 9 main_~i~1) .cse1) (and (<= main_~i~1 7) (<= (+ .cse2 .cse6 .cse8 .cse3 .cse4 .cse10 .cse5) 15032385529) (<= 0 (+ .cse2 .cse6 15032385536 .cse8 .cse3 .cse4 .cse10 .cse5)) (<= (+ 7 .cse0) main_~i~1) .cse1) (and (<= (+ .cse2 .cse3 .cse5) 6442450941) (<= main_~i~1 3) .cse1 (<= 0 (+ .cse2 .cse3 6442450944 .cse5)) (<= 3 main_~i~1))))) [2022-01-31 18:36:00,750 INFO L854 garLoopResultBuilder]: At program point L34-4(lines 34 36) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse10 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse10 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse10 (+ |main_~#x~0.offset| 32))) (.cse3 (select .cse10 (+ |main_~#x~0.offset| 20))) (.cse4 (select .cse10 (+ |main_~#x~0.offset| 28))) (.cse5 (select .cse10 (+ |main_~#x~0.offset| 8))) (.cse6 (select .cse10 (+ |main_~#x~0.offset| 12))) (.cse7 (select .cse10 (+ |main_~#x~0.offset| 24))) (.cse8 (select .cse10 0)) (.cse9 (select .cse10 (+ |main_~#x~0.offset| 36)))) (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) 21474836470) (<= 0 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 21474836480 .cse9)) (= |main_~#x~0.offset| 0)))) [2022-01-31 18:36:00,750 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 26 53) the Hoare annotation is: true [2022-01-31 18:36:00,751 INFO L854 garLoopResultBuilder]: At program point L49(lines 49 51) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse20 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse20 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse20 (+ |main_~#x~0.offset| 32))) (.cse3 (select .cse20 (+ |main_~#x~0.offset| 20))) (.cse4 (select .cse20 (+ |main_~#x~0.offset| 28))) (.cse5 (select .cse20 (+ |main_~#x~0.offset| 8))) (.cse6 (select .cse20 (+ |main_~#x~0.offset| 12))) (.cse7 (select .cse20 (+ |main_~#x~0.offset| 24))) (.cse8 (select .cse20 0)) (.cse9 (select .cse20 (+ |main_~#x~0.offset| 36)))) (let ((.cse11 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse12 (div .cse11 10))) (and (or (let ((.cse10 (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 10 .cse8 .cse9) 10))) (and (<= (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (* (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (- 21474836480) .cse6 .cse7 .cse8 .cse9) 42949672960) (- 42949672960)) .cse9) 10) .cse10) (= .cse10 main_~ret~1))) (<= (div (+ .cse0 (- 42949672951) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (* (- 42949672960) (div .cse11 42949672960))) 10) .cse12)) (let ((.cse14 (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8))) (let ((.cse18 (div .cse14 10))) (let ((.cse13 (= .cse18 main_~ret~1)) (.cse17 (* (- 42949672960) (div (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 (- 21474836480) .cse6 .cse7 .cse8) 42949672960)))) (or (and (or (and .cse13 (<= .cse14 21474836470)) (and (<= (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8 1) 0) (let ((.cse15 (+ .cse0 .cse1 .cse2 .cse3 9 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8))) (<= (* (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8 (* (div .cse15 42949672960) (- 42949672960))) 10) 10) .cse15)))) (or (let ((.cse16 (div (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 10 .cse8) 10))) (and (= .cse16 main_~ret~1) (<= (div (+ (- 42949672950) .cse0 .cse17 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8) 10) .cse16))) (<= 0 .cse14))) (and .cse13 (<= (div (+ .cse0 .cse17 (- 42949672951) .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8) 10) .cse18)))))) (or (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 1) 0) (let ((.cse19 (+ .cse0 .cse1 .cse2 .cse3 9 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (* (- 42949672960) (div .cse19 42949672960)) .cse8 .cse9) 10) 10) .cse19))) (and (<= .cse11 21474836470) (= main_~ret~1 .cse12))) (= |main_~#x~0.offset| 0) (= main_~ret~1 main_~ret5~0) (= main_~ret~1 main_~ret2~0)))))) [2022-01-31 18:36:00,751 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse21 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse21 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse21 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse21 (+ |main_~#x~0.offset| 32))) (.cse3 (select .cse21 (+ |main_~#x~0.offset| 20))) (.cse4 (select .cse21 (+ |main_~#x~0.offset| 28))) (.cse5 (select .cse21 (+ |main_~#x~0.offset| 8))) (.cse6 (select .cse21 (+ |main_~#x~0.offset| 12))) (.cse7 (select .cse21 (+ |main_~#x~0.offset| 24))) (.cse8 (select .cse21 0)) (.cse9 (select .cse21 (+ |main_~#x~0.offset| 36)))) (let ((.cse11 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse12 (div .cse11 10))) (and (or (let ((.cse10 (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 10 .cse8 .cse9) 10))) (and (<= (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (* (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (- 21474836480) .cse6 .cse7 .cse8 .cse9) 42949672960) (- 42949672960)) .cse9) 10) .cse10) (= .cse10 main_~ret~1))) (<= (div (+ .cse0 (- 42949672951) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (* (- 42949672960) (div .cse11 42949672960))) 10) .cse12)) (or (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 1) 0) (let ((.cse13 (+ .cse0 .cse1 .cse2 .cse3 9 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (* (- 42949672960) (div .cse13 42949672960)) .cse8 .cse9) 10) 10) .cse13))) (and (<= .cse11 21474836470) (= main_~ret~1 .cse12))) (let ((.cse18 (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8))) (let ((.cse16 (div .cse18 10))) (let ((.cse14 (= .cse16 main_~ret~1)) (.cse15 (* (- 42949672960) (div (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 (- 21474836480) .cse6 .cse7 .cse8) 42949672960))) (.cse17 (= main_~ret~1 main_~ret2~0))) (or (and .cse14 (<= (div (+ .cse0 .cse15 (- 42949672951) .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8) 10) .cse16) .cse17) (and (or (and .cse14 (<= .cse18 21474836470) .cse17) (and (<= (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8 1) 0) (let ((.cse19 (+ .cse0 .cse1 .cse2 .cse3 9 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8))) (<= (* (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8 (* (div .cse19 42949672960) (- 42949672960))) 10) 10) .cse19)))) (or (<= 0 .cse18) (let ((.cse20 (div (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 10 .cse8) 10))) (and (= .cse20 main_~ret~1) (<= (div (+ (- 42949672950) .cse0 .cse15 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8) 10) .cse20) .cse17)))))))) (= |main_~#x~0.offset| 0)))))) [2022-01-31 18:36:00,751 INFO L861 garLoopResultBuilder]: At program point L49-2(lines 49 51) the Hoare annotation is: true [2022-01-31 18:36:00,751 INFO L854 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse20 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse20 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse20 (+ |main_~#x~0.offset| 32))) (.cse3 (select .cse20 (+ |main_~#x~0.offset| 20))) (.cse4 (select .cse20 (+ |main_~#x~0.offset| 28))) (.cse5 (select .cse20 (+ |main_~#x~0.offset| 8))) (.cse6 (select .cse20 (+ |main_~#x~0.offset| 12))) (.cse7 (select .cse20 (+ |main_~#x~0.offset| 24))) (.cse8 (select .cse20 0)) (.cse9 (select .cse20 (+ |main_~#x~0.offset| 36)))) (let ((.cse11 (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse12 (div .cse11 10))) (and (or (let ((.cse10 (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 10 .cse8 .cse9) 10))) (and (<= (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (* (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (- 21474836480) .cse6 .cse7 .cse8 .cse9) 42949672960) (- 42949672960)) .cse9) 10) .cse10) (= .cse10 main_~ret~1))) (<= (div (+ .cse0 (- 42949672951) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (* (- 42949672960) (div .cse11 42949672960))) 10) .cse12)) (let ((.cse14 (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8))) (let ((.cse18 (div .cse14 10))) (let ((.cse13 (= .cse18 main_~ret~1)) (.cse17 (* (- 42949672960) (div (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 (- 21474836480) .cse6 .cse7 .cse8) 42949672960)))) (or (and (or (and .cse13 (<= .cse14 21474836470)) (and (<= (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8 1) 0) (let ((.cse15 (+ .cse0 .cse1 .cse2 .cse3 9 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8))) (<= (* (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8 (* (div .cse15 42949672960) (- 42949672960))) 10) 10) .cse15)))) (or (let ((.cse16 (div (+ .cse0 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 10 .cse8) 10))) (and (= .cse16 main_~ret~1) (<= (div (+ (- 42949672950) .cse0 .cse17 .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8) 10) .cse16))) (<= 0 .cse14))) (and .cse13 (<= (div (+ .cse0 .cse17 (- 42949672951) .cse1 .cse2 .cse3 main_~temp~0 .cse4 .cse5 .cse6 .cse7 .cse8) 10) .cse18)))))) (= |main_#t~ret12| main_~ret~1) (or (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 1) 0) (let ((.cse19 (+ .cse0 .cse1 .cse2 .cse3 9 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (* (- 42949672960) (div .cse19 42949672960)) .cse8 .cse9) 10) 10) .cse19))) (and (<= .cse11 21474836470) (= main_~ret~1 .cse12))) (= |main_~#x~0.offset| 0) (= main_~ret~1 main_~ret2~0)))))) [2022-01-31 18:36:00,751 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (let ((.cse14 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse2 (select .cse14 12)) (.cse3 (select .cse14 (+ |main_~#x~0.offset| 4))) (.cse4 (select .cse14 (+ |main_~#x~0.offset| 16))) (.cse5 (select .cse14 (+ |main_~#x~0.offset| 32))) (.cse6 (select .cse14 (+ |main_~#x~0.offset| 20))) (.cse7 (select .cse14 (+ |main_~#x~0.offset| 28))) (.cse8 (select .cse14 (+ |main_~#x~0.offset| 8))) (.cse9 (select .cse14 (+ |main_~#x~0.offset| 24))) (.cse10 (select .cse14 |main_~#x~0.offset|)) (.cse11 (select .cse14 (+ |main_~#x~0.offset| 36)))) (let ((.cse12 (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (let ((.cse13 (div .cse12 10))) (let ((.cse0 (= main_~ret~1 .cse13)) (.cse1 (<= .cse12 21474836470))) (or (and (or (and .cse0 .cse1) (<= (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 1) 0)) (or (<= 0 .cse12) (and (<= 0 (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 21474836480 .cse11)) (= (+ .cse13 1) main_~ret~1))) (<= .cse12 (+ (* 10 (div (+ (- 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (select .cse14 (+ |main_~#x~0.offset| 12)) .cse9 .cse10 .cse11) 10)) 9))) (and (<= (div (+ .cse2 .cse3 (- 42949672951) .cse4 (* (- 42949672960) (div (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (- 21474836480) .cse9 .cse10 .cse11) 42949672960)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) 10) .cse13) .cse0 .cse1))))))) (= |main_~#x~0.offset| 0)) [2022-01-31 18:36:00,752 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 43 45) the Hoare annotation is: (let ((.cse104 (+ |main_~#x~0.offset| 16)) (.cse49 (+ |main_~#x~0.offset| 8)) (.cse0 (* main_~i~2 4)) (.cse50 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse53 (select .cse50 (+ |main_~#x~0.offset| 24))) (.cse39 (select .cse50 (+ |main_~#x~0.offset| .cse0 28))) (.cse38 (select .cse50 (+ |main_~#x~0.offset| .cse0 24))) (.cse8 (select .cse50 (+ |main_~#x~0.offset| .cse0 8))) (.cse1 (select .cse50 (+ |main_~#x~0.offset| 4))) (.cse36 (select .cse50 (+ |main_~#x~0.offset| .cse0 20))) (.cse24 (select .cse50 (+ |main_~#x~0.offset| .cse0 16))) (.cse5 (select .cse50 (+ |main_~#x~0.offset| .cse0 12))) (.cse6 (select .cse50 .cse49)) (.cse75 (select .cse50 (+ .cse0 8))) (.cse7 (select .cse50 (+ |main_~#x~0.offset| 12))) (.cse9 (select .cse50 0)) (.cse17 (= main_~ret~1 main_~ret2~0)) (.cse21 (= |main_~#x~0.offset| 0)) (.cse14 (select .cse50 (+ |main_~#x~0.offset| .cse0 4))) (.cse2 (select .cse50 (+ |main_~#x~0.offset| .cse0))) (.cse3 (select .cse50 .cse104)) (.cse4 (select .cse50 (+ |main_~#x~0.offset| 20))) (.cse62 (select .cse50 (+ |main_~#x~0.offset| 28)))) (or (let ((.cse12 (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse11 (div .cse12 10))) (and (= .cse0 24) (or (and (let ((.cse10 (+ .cse1 .cse2 .cse3 .cse4 9 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9 (* (- 42949672960) (div .cse10 42949672960))) 10) 10) .cse10)) (<= (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9 1) 0)) (and (= main_~ret~1 .cse11) (<= .cse12 21474836470))) (let ((.cse18 (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse16 (div .cse18 10))) (let ((.cse13 (= .cse16 main_~ret~1)) (.cse15 (* (div (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse5 .cse6 (- 21474836480) .cse7 .cse8 .cse9) 42949672960) (- 42949672960)))) (or (and .cse13 (<= (div (+ .cse1 (- 42949672951) .cse3 .cse4 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9) 10) .cse16) .cse17) (and (or (and .cse13 (<= .cse18 21474836470) .cse17) (and (let ((.cse19 (+ .cse1 .cse3 .cse4 .cse14 9 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse3 .cse4 .cse14 main_~temp~0 (* (- 42949672960) (div .cse19 42949672960)) .cse5 .cse6 .cse7 .cse8 .cse9) 10) 10) .cse19)) (<= (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9 1) 0))) (or (let ((.cse20 (div (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 10 .cse9) 10))) (and (= .cse20 main_~ret~1) (<= (div (+ (- 42949672950) .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9) 10) .cse20) .cse17)) (<= 0 .cse18))))))) .cse21 (let ((.cse22 (* (- 42949672960) (div (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse5 .cse6 (- 21474836480) .cse7 .cse8 .cse9) 42949672960)))) (or (<= 0 .cse12) (<= (div (+ .cse1 .cse2 (- 42949672951) .cse3 .cse4 .cse22 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9) 10) .cse11) (let ((.cse23 (div (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse5 .cse6 .cse7 .cse8 10 .cse9) 10))) (and (= main_~ret~1 .cse23) (<= (div (+ (- 42949672950) .cse1 .cse2 .cse3 .cse4 .cse22 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9) 10) .cse23)))))))) (let ((.cse27 (+ .cse1 .cse2 .cse3 .cse24 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse26 (div .cse27 10))) (and (let ((.cse25 (* (div (+ .cse1 .cse2 .cse3 .cse24 main_~temp~0 .cse5 .cse6 (- 21474836480) .cse7 .cse8 .cse9) 42949672960) (- 42949672960)))) (or (<= (div (+ .cse1 .cse2 (- 42949672951) .cse3 .cse24 .cse25 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9) 10) .cse26) (<= 0 .cse27) (let ((.cse28 (div (+ .cse1 .cse2 .cse3 .cse24 main_~temp~0 .cse5 .cse6 .cse7 .cse8 10 .cse9) 10))) (and (= main_~ret~1 .cse28) (<= (div (+ (- 42949672950) .cse1 .cse2 .cse3 .cse24 .cse25 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9) 10) .cse28) .cse17)))) .cse21 (let ((.cse29 (+ .cse1 .cse3 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse34 (div .cse29 10))) (let ((.cse32 (= main_~ret~1 .cse34)) (.cse31 (* (- 42949672960) (div (+ .cse1 .cse3 .cse24 .cse14 main_~temp~0 .cse5 .cse6 (- 21474836480) .cse7 .cse8 .cse9) 42949672960)))) (or (and (or (<= 0 .cse29) (let ((.cse30 (div (+ .cse1 .cse3 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 10 .cse9) 10))) (and (= main_~ret~1 .cse30) (<= (div (+ .cse31 (- 42949672950) .cse1 .cse3 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9) 10) .cse30)))) (or (and .cse32 (<= .cse29 21474836470)) (and (<= (+ .cse1 .cse3 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9 1) 0) (let ((.cse33 (+ .cse1 .cse3 .cse24 .cse14 9 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse3 .cse24 .cse14 main_~temp~0 (* (- 42949672960) (div .cse33 42949672960)) .cse5 .cse6 .cse7 .cse8 .cse9) 10) 10) .cse33))))) (and .cse32 (<= (div (+ .cse31 .cse1 (- 42949672951) .cse3 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9) 10) .cse34)))))) (or (and (<= (+ .cse1 .cse2 .cse3 .cse24 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9 1) 0) (let ((.cse35 (+ .cse1 .cse2 .cse3 .cse24 9 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse2 (* (- 42949672960) (div .cse35 42949672960)) .cse3 .cse24 main_~temp~0 .cse5 .cse6 .cse7 .cse8 .cse9) 10) 10) .cse35))) (and (<= .cse27 21474836470) (= main_~ret~1 .cse26) .cse17)) (= .cse0 20)))) (let ((.cse37 (select .cse50 (+ .cse0 16)))) (let ((.cse42 (+ .cse1 .cse36 .cse14 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9)) (.cse43 (+ .cse1 .cse2 .cse36 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9))) (let ((.cse45 (div .cse43 10)) (.cse41 (div .cse42 10))) (and (or (and (<= (+ .cse1 .cse36 .cse14 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9 1) 0) (let ((.cse40 (+ .cse1 .cse36 .cse14 9 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse36 .cse14 (* (- 42949672960) (div .cse40 42949672960)) main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9) 10) 10) .cse40))) (and (= .cse41 main_~ret~1) (<= .cse42 21474836470))) (let ((.cse44 (* (- 42949672960) (div (+ .cse1 .cse2 .cse36 main_~temp~0 .cse37 .cse38 .cse5 (- 21474836480) .cse39 .cse8 .cse9) 42949672960)))) (or (<= 0 .cse43) (<= (div (+ .cse1 .cse2 .cse36 (- 42949672951) .cse44 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9) 10) .cse45) (let ((.cse46 (div (+ .cse1 .cse2 .cse36 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 10 .cse9) 10))) (and (<= (div (+ (- 42949672950) .cse1 .cse2 .cse36 .cse44 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9) 10) .cse46) (= .cse46 main_~ret~1))))) (or (and (let ((.cse47 (+ .cse1 .cse2 .cse36 9 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse2 .cse36 (* (- 42949672960) (div .cse47 42949672960)) main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9) 10) 10) .cse47)) (<= (+ .cse1 .cse2 .cse36 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9 1) 0)) (and (= main_~ret~1 .cse45) (<= .cse43 21474836470))) (or (let ((.cse48 (div (+ .cse1 .cse36 .cse14 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 10 .cse9) 10))) (and (= main_~ret~1 .cse48) (<= (div (+ (- 42949672950) .cse1 .cse36 .cse14 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 (* (div (+ .cse1 .cse36 .cse14 main_~temp~0 .cse37 .cse38 .cse5 (- 21474836480) .cse39 .cse8 .cse9) 42949672960) (- 42949672960)) .cse9) 10) .cse48) .cse17)) (and (<= (div (+ (* (- 42949672960) (div .cse42 42949672960)) .cse1 .cse36 (- 42949672951) .cse14 main_~temp~0 .cse37 .cse38 .cse5 .cse39 .cse8 .cse9) 10) .cse41) .cse17)) .cse21 (= .cse49 .cse0))))) (let ((.cse55 (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9)) (.cse51 (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9))) (let ((.cse52 (div .cse51 10)) (.cse57 (div .cse55 10))) (and (or (and (<= .cse51 21474836470) (= main_~ret~1 .cse52)) (and (let ((.cse54 (+ .cse1 .cse3 .cse4 .cse14 9 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse6 .cse7 .cse53 .cse8 (* (div .cse54 42949672960) (- 42949672960)) .cse9) 10) 10) .cse54)) (<= (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9 1) 0))) (let ((.cse56 (* (- 42949672960) (div (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse6 (- 21474836480) .cse7 .cse53 .cse8 .cse9) 42949672960)))) (or (<= 0 .cse55) (<= (div (+ .cse56 .cse1 .cse2 (- 42949672951) .cse3 .cse4 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9) 10) .cse57) (let ((.cse58 (div (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse6 .cse7 .cse53 .cse8 10 .cse9) 10))) (and (= .cse58 main_~ret~1) (<= (div (+ (- 42949672950) .cse56 .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9) 10) .cse58) .cse17)))) (= .cse0 28) (let ((.cse59 (* (div (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse6 (- 21474836480) .cse7 .cse53 .cse8 .cse9) 42949672960) (- 42949672960)))) (or (<= 0 .cse51) (<= (div (+ .cse1 (- 42949672951) .cse3 .cse4 .cse14 main_~temp~0 .cse59 .cse6 .cse7 .cse53 .cse8 .cse9) 10) .cse52) (let ((.cse60 (div (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse6 .cse7 .cse53 .cse8 10 .cse9) 10))) (and (<= (div (+ (- 42949672950) .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse59 .cse6 .cse7 .cse53 .cse8 .cse9) 10) .cse60) (= .cse60 main_~ret~1))))) .cse21 (or (and (let ((.cse61 (+ .cse1 .cse2 .cse3 .cse4 9 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9 (* (- 42949672960) (div .cse61 42949672960))) 10) 10) .cse61)) (<= (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse6 .cse7 .cse53 .cse8 .cse9 1) 0)) (and (<= .cse55 21474836470) (= .cse57 main_~ret~1) .cse17))))) (let ((.cse63 (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9))) (let ((.cse64 (div .cse63 10))) (and (= .cse0 32) (or (<= (div (+ .cse1 .cse2 (- 42949672951) .cse3 .cse4 main_~temp~0 .cse62 .cse6 .cse7 .cse53 (* (- 42949672960) (div .cse63 42949672960)) .cse9) 10) .cse64) (let ((.cse65 (div (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse62 .cse6 .cse7 .cse53 10 .cse9) 10))) (and (<= (div (+ (- 42949672950) .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse62 .cse6 .cse7 .cse53 (* (- 42949672960) (div (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse62 .cse6 (- 21474836480) .cse7 .cse53 .cse9) 42949672960)) .cse9) 10) .cse65) (= main_~ret~1 .cse65) .cse17))) .cse21 (let ((.cse70 (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9))) (let ((.cse68 (div .cse70 10))) (let ((.cse66 (= .cse68 main_~ret~1)) (.cse67 (* (- 42949672960) (div (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse62 .cse6 (- 21474836480) .cse7 .cse53 .cse9) 42949672960)))) (or (and .cse66 (<= (div (+ .cse1 (- 42949672951) .cse3 .cse67 .cse4 .cse14 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9) 10) .cse68)) (and (or (and (<= (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9 1) 0) (let ((.cse69 (+ .cse1 .cse3 .cse4 .cse14 9 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse62 .cse6 .cse7 .cse53 (* (div .cse69 42949672960) (- 42949672960)) .cse9) 10) 10) .cse69))) (and .cse66 (<= .cse70 21474836470))) (or (<= 0 .cse70) (let ((.cse71 (div (+ .cse1 .cse3 .cse4 .cse14 main_~temp~0 .cse62 .cse6 .cse7 .cse53 10 .cse9) 10))) (and (= .cse71 main_~ret~1) (<= (div (+ (- 42949672950) .cse1 .cse3 .cse67 .cse4 .cse14 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9) 10) .cse71))))))))) (or (and (let ((.cse72 (+ .cse1 .cse2 .cse3 .cse4 9 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse2 .cse3 (* (div .cse72 42949672960) (- 42949672960)) .cse4 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9) 10) 10) .cse72)) (<= (+ .cse1 .cse2 .cse3 .cse4 main_~temp~0 .cse62 .cse6 .cse7 .cse53 .cse9 1) 0)) (and (<= .cse63 21474836470) (= .cse64 main_~ret~1) .cse17))))) (let ((.cse73 (select .cse50 (+ |main_~#x~0.offset| .cse0 32))) (.cse74 (select .cse50 (+ .cse0 20)))) (let ((.cse76 (+ .cse73 .cse24 .cse74 .cse14 main_~temp~0 .cse38 .cse5 .cse39 .cse75 .cse9))) (let ((.cse77 (div .cse76 10))) (and (or (and (<= (div (+ (- 42949672951) .cse73 .cse24 .cse74 .cse14 main_~temp~0 .cse38 .cse5 .cse39 .cse75 (* (- 42949672960) (div .cse76 42949672960)) .cse9) 10) .cse77) .cse17) (let ((.cse78 (div (+ .cse73 .cse24 .cse74 .cse14 main_~temp~0 .cse38 .cse5 .cse39 .cse75 10 .cse9) 10))) (and (= main_~ret~1 .cse78) (<= (div (+ (- 42949672950) .cse73 .cse24 .cse74 .cse14 main_~temp~0 .cse38 .cse5 .cse39 .cse75 (* (- 42949672960) (div (+ .cse73 .cse24 .cse74 .cse14 main_~temp~0 .cse38 .cse5 (- 21474836480) .cse39 .cse75 .cse9) 42949672960)) .cse9) 10) .cse78) .cse17))) .cse21 (or (and (let ((.cse79 (+ .cse73 .cse24 .cse74 .cse14 9 main_~temp~0 .cse38 .cse5 .cse39 .cse75 .cse9))) (<= (* (div (+ (- 42949672950) .cse73 .cse24 .cse74 .cse14 main_~temp~0 (* (- 42949672960) (div .cse79 42949672960)) .cse38 .cse5 .cse39 .cse75 .cse9) 10) 10) .cse79)) (<= (+ .cse73 .cse24 .cse74 .cse14 main_~temp~0 .cse38 .cse5 .cse39 .cse75 .cse9 1) 0)) (and (= main_~ret~1 .cse77) (<= .cse76 21474836470))) (= .cse0 4) (let ((.cse83 (+ .cse2 .cse73 .cse24 .cse74 main_~temp~0 .cse38 .cse5 .cse39 .cse75 .cse9))) (let ((.cse82 (div .cse83 10))) (let ((.cse80 (= .cse82 main_~ret~1)) (.cse81 (* (- 42949672960) (div (+ .cse2 .cse73 .cse24 .cse74 main_~temp~0 .cse38 .cse5 (- 21474836480) .cse39 .cse75 .cse9) 42949672960)))) (or (and .cse80 (<= (div (+ .cse2 (- 42949672951) .cse73 .cse24 .cse74 main_~temp~0 .cse38 .cse81 .cse5 .cse39 .cse75 .cse9) 10) .cse82)) (and (or (and .cse80 (<= .cse83 21474836470)) (and (let ((.cse84 (+ .cse2 .cse73 .cse24 .cse74 9 main_~temp~0 .cse38 .cse5 .cse39 .cse75 .cse9))) (<= (* (div (+ (- 42949672950) .cse2 (* (div .cse84 42949672960) (- 42949672960)) .cse73 .cse24 .cse74 main_~temp~0 .cse38 .cse5 .cse39 .cse75 .cse9) 10) 10) .cse84)) (<= (+ .cse2 .cse73 .cse24 .cse74 main_~temp~0 .cse38 .cse5 .cse39 .cse75 .cse9 1) 0))) (or (let ((.cse85 (div (+ .cse2 .cse73 .cse24 .cse74 main_~temp~0 .cse38 .cse5 .cse39 .cse75 10 .cse9) 10))) (and (<= (div (+ (- 42949672950) .cse2 .cse73 .cse24 .cse74 main_~temp~0 .cse38 .cse81 .cse5 .cse39 .cse75 .cse9) 10) .cse85) (= main_~ret~1 .cse85))) (<= 0 .cse83))))))))))) (let ((.cse86 (select .cse50 (+ .cse0 12)))) (let ((.cse88 (+ .cse1 .cse2 .cse36 .cse24 .cse86 main_~temp~0 .cse38 .cse6 .cse8 .cse9)) (.cse91 (+ .cse1 .cse36 .cse24 .cse14 .cse86 main_~temp~0 .cse38 .cse6 .cse8 .cse9))) (let ((.cse90 (div .cse91 10)) (.cse89 (div .cse88 10))) (and (or (and (<= (+ .cse1 .cse2 .cse36 .cse24 .cse86 main_~temp~0 .cse38 .cse6 .cse8 .cse9 1) 0) (let ((.cse87 (+ .cse1 .cse2 .cse36 .cse24 .cse86 9 main_~temp~0 .cse38 .cse6 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse2 .cse36 .cse24 .cse86 main_~temp~0 .cse38 .cse6 (* (- 42949672960) (div .cse87 42949672960)) .cse8 .cse9) 10) 10) .cse87))) (and (<= .cse88 21474836470) (= .cse89 main_~ret~1))) (or (and (= main_~ret~1 .cse90) (<= .cse91 21474836470) .cse17) (and (<= (+ .cse1 .cse36 .cse24 .cse14 .cse86 main_~temp~0 .cse38 .cse6 .cse8 .cse9 1) 0) (let ((.cse92 (+ .cse1 .cse36 .cse24 .cse14 .cse86 9 main_~temp~0 .cse38 .cse6 .cse8 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse36 .cse24 (* (- 42949672960) (div .cse92 42949672960)) .cse14 .cse86 main_~temp~0 .cse38 .cse6 .cse8 .cse9) 10) 10) .cse92)))) .cse21 (or (let ((.cse93 (div (+ .cse1 .cse36 .cse24 .cse14 .cse86 main_~temp~0 .cse38 .cse6 .cse8 10 .cse9) 10))) (and (= main_~ret~1 .cse93) (<= (div (+ (- 42949672950) .cse1 .cse36 .cse24 .cse14 .cse86 main_~temp~0 .cse38 .cse6 .cse8 (* (- 42949672960) (div (+ .cse1 .cse36 .cse24 .cse14 .cse86 main_~temp~0 .cse38 .cse6 (- 21474836480) .cse8 .cse9) 42949672960)) .cse9) 10) .cse93) .cse17)) (<= (div (+ .cse1 .cse36 (- 42949672951) .cse24 .cse14 .cse86 main_~temp~0 .cse38 (* (div .cse91 42949672960) (- 42949672960)) .cse6 .cse8 .cse9) 10) .cse90)) (<= (+ 3 (div (* (- 1) |main_~#x~0.offset|) 4)) main_~i~2) (or (and (<= (div (+ .cse1 .cse2 .cse36 (- 42949672951) (* (- 42949672960) (div .cse88 42949672960)) .cse24 .cse86 main_~temp~0 .cse38 .cse6 .cse8 .cse9) 10) .cse89) (<= 0 (+ .cse1 .cse2 .cse36 .cse24 .cse86 main_~temp~0 .cse38 .cse6 .cse8 .cse9 21474836480))) (let ((.cse94 (div (+ .cse1 .cse2 .cse36 .cse24 .cse86 main_~temp~0 .cse38 .cse6 .cse8 10 .cse9) 10))) (and (<= (div (+ (- 42949672950) .cse1 .cse2 .cse36 .cse24 (* (- 42949672960) (div (+ .cse1 .cse2 .cse36 .cse24 .cse86 main_~temp~0 .cse38 .cse6 (- 21474836480) .cse8 .cse9) 42949672960)) .cse86 main_~temp~0 .cse38 .cse6 .cse8 .cse9) 10) .cse94) (= main_~ret~1 .cse94)))) (<= main_~i~2 3))))) (let ((.cse95 (+ .cse1 .cse2 .cse36 .cse24 main_~temp~0 .cse5 .cse6 .cse75 .cse7 .cse9)) (.cse100 (+ .cse1 .cse36 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse75 .cse7 .cse9))) (let ((.cse101 (div .cse100 10)) (.cse96 (div .cse95 10))) (and (or (and (<= .cse95 21474836470) (= .cse96 main_~ret~1)) (and (<= (+ .cse1 .cse2 .cse36 .cse24 main_~temp~0 .cse5 .cse6 .cse75 .cse7 .cse9 1) 0) (let ((.cse97 (+ .cse1 .cse2 .cse36 .cse24 9 main_~temp~0 .cse5 .cse6 .cse75 .cse7 .cse9))) (<= (* 10 (div (+ (- 42949672950) .cse1 .cse2 .cse36 .cse24 main_~temp~0 .cse5 .cse6 (* (div .cse97 42949672960) (- 42949672960)) .cse75 .cse7 .cse9) 10)) .cse97)))) (let ((.cse99 (* (- 42949672960) (div (+ .cse1 .cse36 .cse24 .cse14 main_~temp~0 .cse5 .cse6 (- 21474836480) .cse75 .cse7 .cse9) 42949672960)))) (or (let ((.cse98 (div (+ .cse1 .cse36 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse75 .cse7 10 .cse9) 10))) (and (= .cse98 main_~ret~1) (<= (div (+ .cse99 (- 42949672950) .cse1 .cse36 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse75 .cse7 .cse9) 10) .cse98) .cse17)) (<= 0 .cse100) (<= (div (+ .cse99 .cse1 .cse36 (- 42949672951) .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse75 .cse7 .cse9) 10) .cse101))) (or (and (let ((.cse102 (+ .cse1 .cse36 .cse24 .cse14 9 main_~temp~0 .cse5 .cse6 .cse75 .cse7 .cse9))) (<= (* (div (+ (- 42949672950) .cse1 .cse36 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse75 .cse7 (* (- 42949672960) (div .cse102 42949672960)) .cse9) 10) 10) .cse102)) (<= (+ .cse1 .cse36 .cse24 .cse14 main_~temp~0 .cse5 .cse6 .cse75 .cse7 .cse9 1) 0)) (and (<= .cse100 21474836470) (= main_~ret~1 .cse101) .cse17)) (= .cse0 16) (or (let ((.cse103 (div (+ .cse1 .cse2 .cse36 .cse24 main_~temp~0 .cse5 .cse6 .cse75 .cse7 10 .cse9) 10))) (and (= main_~ret~1 .cse103) (<= (div (+ (- 42949672950) .cse1 .cse2 .cse36 .cse24 main_~temp~0 .cse5 .cse6 (* (- 42949672960) (div (+ .cse1 .cse2 .cse36 .cse24 main_~temp~0 .cse5 .cse6 (- 21474836480) .cse75 .cse7 .cse9) 42949672960)) .cse75 .cse7 .cse9) 10) .cse103))) (<= (div (+ .cse1 .cse2 .cse36 (- 42949672951) .cse24 main_~temp~0 .cse5 .cse6 .cse75 .cse7 (* (div .cse95 42949672960) (- 42949672960)) .cse9) 10) .cse96)) (= .cse0 .cse104)))) (let ((.cse105 (select .cse50 12)) (.cse106 (select .cse50 (+ |main_~#x~0.offset| 32))) (.cse107 (select .cse50 8)) (.cse108 (select .cse50 24)) (.cse109 (select .cse50 (+ |main_~#x~0.offset| 36)))) (let ((.cse111 (+ .cse105 .cse2 .cse3 .cse106 .cse107 .cse4 main_~temp~0 .cse62 .cse108 .cse109)) (.cse115 (+ .cse105 .cse3 .cse106 .cse107 .cse4 .cse14 main_~temp~0 .cse62 .cse108 .cse109))) (let ((.cse113 (+ .cse105 .cse3 .cse106 .cse107 .cse4 .cse14 main_~temp~0 .cse62 .cse108 10 .cse109)) (.cse116 (* (- 42949672960) (div .cse115 42949672960))) (.cse117 (div .cse115 10)) (.cse112 (div .cse111 10))) (and (or (let ((.cse110 (div (+ .cse105 .cse2 .cse3 .cse106 .cse107 .cse4 main_~temp~0 .cse62 .cse108 10 .cse109) 10))) (and (<= (div (+ (- 42949672950) .cse105 .cse2 .cse3 .cse106 .cse107 .cse4 (* (- 42949672960) (div (+ .cse105 .cse2 .cse3 .cse106 .cse107 .cse4 main_~temp~0 .cse62 (- 21474836480) .cse108 .cse109) 42949672960)) main_~temp~0 .cse62 .cse108 .cse109) 10) .cse110) (= .cse110 main_~ret~1))) (<= (div (+ .cse105 .cse2 (- 42949672951) .cse3 .cse106 .cse107 .cse4 main_~temp~0 .cse62 .cse108 (* (- 42949672960) (div .cse111 42949672960)) .cse109) 10) .cse112)) (let ((.cse114 (= .cse117 main_~ret~1))) (or (and (<= 0 (+ .cse105 .cse3 .cse106 .cse107 .cse4 .cse14 main_~temp~0 .cse62 .cse108 21474836480 .cse109)) (<= .cse113 0) .cse114 .cse17) (and (<= .cse115 21474836470) (<= (div (+ .cse105 .cse3 .cse106 .cse107 .cse4 .cse14 .cse116 main_~temp~0 .cse62 .cse108 .cse109) 10) .cse117) .cse114 .cse17) (and (let ((.cse118 (+ .cse105 .cse3 .cse106 .cse107 .cse4 .cse14 9 main_~temp~0 .cse62 .cse108 .cse109))) (<= (* (div (+ (- 42949672950) .cse105 .cse3 (* (div .cse118 42949672960) (- 42949672960)) .cse106 .cse107 .cse4 .cse14 main_~temp~0 .cse62 .cse108 .cse109) 10) 10) .cse118)) (<= (+ .cse105 .cse3 .cse106 .cse107 .cse4 .cse14 main_~temp~0 .cse62 .cse108 .cse109 1) 0)))) (or (let ((.cse119 (div .cse113 10))) (and (<= (div (+ (- 42949672950) .cse105 .cse3 .cse106 .cse107 .cse4 .cse14 main_~temp~0 .cse62 .cse108 (* (div (+ .cse105 .cse3 .cse106 .cse107 .cse4 .cse14 main_~temp~0 .cse62 (- 21474836480) .cse108 .cse109) 42949672960) (- 42949672960)) .cse109) 10) .cse119) (= main_~ret~1 .cse119) .cse17)) (<= (div (+ .cse105 (- 42949672951) .cse3 .cse106 .cse107 .cse4 .cse14 .cse116 main_~temp~0 .cse62 .cse108 .cse109) 10) .cse117)) .cse21 (or (and (<= (+ .cse105 .cse2 .cse3 .cse106 .cse107 .cse4 main_~temp~0 .cse62 .cse108 .cse109 1) 0) (let ((.cse120 (+ .cse105 .cse2 .cse3 .cse106 .cse107 .cse4 9 main_~temp~0 .cse62 .cse108 .cse109))) (<= (* (div (+ (- 42949672950) .cse105 .cse2 .cse3 .cse106 .cse107 .cse4 main_~temp~0 .cse62 (* (- 42949672960) (div .cse120 42949672960)) .cse108 .cse109) 10) 10) .cse120))) (and (<= .cse111 21474836470) (= main_~ret~1 .cse112))) (= main_~i~2 0)))))))) [2022-01-31 18:36:00,753 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse1 (select .cse12 12)) (.cse2 (select .cse12 (+ |main_~#x~0.offset| 4))) (.cse3 (select .cse12 (+ |main_~#x~0.offset| 16))) (.cse4 (select .cse12 (+ |main_~#x~0.offset| 32))) (.cse16 (select .cse12 8)) (.cse5 (select .cse12 (+ |main_~#x~0.offset| 20))) (.cse6 (select .cse12 (+ |main_~#x~0.offset| 28))) (.cse17 (select .cse12 24)) (.cse9 (select .cse12 |main_~#x~0.offset|)) (.cse10 (select .cse12 (+ |main_~#x~0.offset| 36)))) (let ((.cse13 (+ .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse9 .cse10))) (let ((.cse15 (div .cse13 10)) (.cse14 (= main_~ret~1 |main_#t~ret8|))) (and (let ((.cse7 (select .cse12 (+ |main_~#x~0.offset| 8))) (.cse8 (select .cse12 (+ |main_~#x~0.offset| 24)))) (let ((.cse0 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (div .cse0 10))) (or (<= 0 .cse0) (and (<= 0 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 21474836480 .cse10)) (= (+ .cse11 1) main_~ret~1)) (<= (div (+ .cse1 .cse2 (- 42949672951) .cse3 (* (- 42949672960) (div (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (- 21474836480) .cse8 .cse9 .cse10) 42949672960)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) 10) .cse11))))) (or (and (<= .cse13 21474836470) .cse14 (= main_~ret~1 .cse15)) (and (<= (+ .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse9 .cse10 1) 0) (let ((.cse18 (+ .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 9 .cse6 .cse17 .cse9 .cse10))) (<= (* (div (+ (- 42949672950) .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 (* (- 42949672960) (div .cse18 42949672960)) .cse17 .cse9 .cse10) 10) 10) .cse18)))) (= |main_~#x~0.offset| 0) (or (<= (div (+ .cse1 .cse2 (- 42949672951) .cse3 .cse4 (* (- 42949672960) (div .cse13 42949672960)) .cse16 .cse5 .cse6 .cse17 .cse9 .cse10) 10) .cse15) (and (or (<= 2147483648 |main_#t~ret8|) .cse14) (<= (+ .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse9 11 .cse10) 0)) (and (= |main_#t~ret8| 0) (<= 0 (+ .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse9 10 .cse10))))))))) [2022-01-31 18:36:00,753 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse80 (+ |main_~#x~0.offset| 8)) (.cse34 (+ |main_~#x~0.offset| 16)) (.cse62 (select |#memory_int| |main_~#x~0.base|)) (.cse18 (* main_~i~2 4))) (let ((.cse35 (< 7 main_~i~2)) (.cse4 (select .cse62 (+ |main_~#x~0.offset| .cse18 16))) (.cse30 (select .cse62 (+ .cse18 8))) (.cse29 (select .cse62 (+ |main_~#x~0.offset| .cse18 20))) (.cse55 (select .cse62 (+ |main_~#x~0.offset| .cse18 24))) (.cse6 (select .cse62 (+ |main_~#x~0.offset| .cse18 12))) (.cse71 (select .cse62 (+ |main_~#x~0.offset| .cse18 28))) (.cse9 (select .cse62 (+ |main_~#x~0.offset| .cse18 8))) (.cse13 (= main_~ret~1 main_~ret2~0)) (.cse17 (= |main_~#x~0.offset| 0)) (.cse5 (select .cse62 (+ |main_~#x~0.offset| .cse18 4))) (.cse2 (select .cse62 (+ |main_~#x~0.offset| 4))) (.cse3 (select .cse62 .cse34)) (.cse39 (select .cse62 (+ |main_~#x~0.offset| 32))) (.cse21 (select .cse62 (+ |main_~#x~0.offset| 20))) (.cse40 (select .cse62 (+ |main_~#x~0.offset| 28))) (.cse7 (select .cse62 .cse80)) (.cse8 (select .cse62 (+ |main_~#x~0.offset| 12))) (.cse41 (select .cse62 (+ |main_~#x~0.offset| 24))) (.cse10 (select .cse62 0))) (or (and (let ((.cse15 (+ .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse11 (div .cse15 10))) (let ((.cse1 (* (- 42949672960) (div (+ .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 (- 21474836480) .cse8 .cse9 .cse10) 42949672960))) (.cse12 (+ .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 10 .cse10)) (.cse0 (= main_~ret~1 .cse11))) (or (and .cse0 (<= (div (+ .cse1 .cse2 (- 42949672951) .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10) 10) .cse11) (<= .cse12 0) .cse13) (and (or (let ((.cse14 (div .cse12 10))) (and (= main_~ret~1 .cse14) (<= (div (+ .cse1 (- 42949672950) .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10) 10) .cse14) .cse13)) (<= 0 .cse15)) (or (and (<= (+ .cse2 .cse3 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10 1) 0) (let ((.cse16 (+ .cse2 .cse3 .cse4 .cse5 9 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10))) (<= (* (div (+ (- 42949672950) .cse2 .cse3 .cse4 .cse5 main_~temp~0 (* (- 42949672960) (div .cse16 42949672960)) .cse6 .cse7 .cse8 .cse9 .cse10) 10) 10) .cse16))) (and .cse0 (<= .cse15 21474836470) .cse13))))))) .cse17 (= .cse18 20)) (and (= .cse18 24) (let ((.cse24 (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10))) (let ((.cse23 (div .cse24 10))) (let ((.cse20 (= .cse23 main_~ret~1)) (.cse22 (* (div (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse6 .cse7 (- 21474836480) .cse8 .cse9 .cse10) 42949672960) (- 42949672960))) (.cse19 (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 10 .cse10))) (or (and (<= .cse19 0) .cse20 (<= (div (+ .cse2 (- 42949672951) .cse3 .cse21 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10) 10) .cse23) .cse13) (and (or (and .cse20 (<= .cse24 21474836470) .cse13) (and (let ((.cse25 (+ .cse2 .cse3 .cse21 .cse5 9 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10))) (<= (* (div (+ (- 42949672950) .cse2 .cse3 .cse21 .cse5 main_~temp~0 (* (- 42949672960) (div .cse25 42949672960)) .cse6 .cse7 .cse8 .cse9 .cse10) 10) 10) .cse25)) (<= (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse10 1) 0))) (or (let ((.cse26 (div .cse19 10))) (and (= .cse26 main_~ret~1) (<= (div (+ (- 42949672950) .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10) 10) .cse26) .cse13)) (<= 0 .cse24))))))) .cse17) (let ((.cse31 (+ .cse2 .cse29 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse30 .cse8 .cse10))) (let ((.cse32 (div .cse31 10))) (and (let ((.cse28 (* (- 42949672960) (div (+ .cse2 .cse29 .cse4 .cse5 main_~temp~0 .cse6 .cse7 (- 21474836480) .cse30 .cse8 .cse10) 42949672960)))) (or (let ((.cse27 (div (+ .cse2 .cse29 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse30 .cse8 10 .cse10) 10))) (and (= .cse27 main_~ret~1) (<= (div (+ .cse28 (- 42949672950) .cse2 .cse29 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse30 .cse8 .cse10) 10) .cse27) .cse13)) (<= 0 .cse31) (<= (div (+ .cse28 .cse2 .cse29 (- 42949672951) .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse30 .cse8 .cse10) 10) .cse32))) (or (and (let ((.cse33 (+ .cse2 .cse29 .cse4 .cse5 9 main_~temp~0 .cse6 .cse7 .cse30 .cse8 .cse10))) (<= (* (div (+ (- 42949672950) .cse2 .cse29 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse30 .cse8 (* (- 42949672960) (div .cse33 42949672960)) .cse10) 10) 10) .cse33)) (<= (+ .cse2 .cse29 .cse4 .cse5 main_~temp~0 .cse6 .cse7 .cse30 .cse8 .cse10 1) 0)) (and (<= .cse31 21474836470) (= main_~ret~1 .cse32) .cse13)) (= .cse18 16) (= .cse18 .cse34)))) (and .cse35 (let ((.cse43 (+ .cse2 .cse3 .cse39 .cse21 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10))) (let ((.cse42 (div .cse43 10))) (let ((.cse37 (= .cse42 main_~ret~1)) (.cse38 (* (- 42949672960) (div (+ .cse2 .cse3 .cse39 .cse21 main_~temp~0 .cse40 .cse7 (- 21474836480) .cse8 .cse41 .cse10) 42949672960))) (.cse36 (+ .cse2 .cse3 .cse39 .cse21 main_~temp~0 .cse40 .cse7 .cse8 .cse41 10 .cse10))) (or (and (<= .cse36 0) .cse37 (<= (div (+ .cse2 .cse38 (- 42949672951) .cse3 .cse39 .cse21 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10) 10) .cse42) .cse13) (and (or (and .cse37 (<= .cse43 21474836470) .cse13) (and (<= (+ .cse2 .cse3 .cse39 .cse21 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10 1) 0) (let ((.cse44 (+ .cse2 .cse3 .cse39 .cse21 9 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10))) (<= (* (div (+ (- 42949672950) .cse2 .cse3 .cse39 .cse21 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10 (* (div .cse44 42949672960) (- 42949672960))) 10) 10) .cse44)))) (or (<= 0 .cse43) (let ((.cse45 (div .cse36 10))) (and (= .cse45 main_~ret~1) (<= (div (+ (- 42949672950) .cse2 .cse38 .cse3 .cse39 .cse21 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10) 10) .cse45) .cse13)))))))) (not (= .cse18 32)) .cse17) (and .cse35 (let ((.cse51 (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10))) (let ((.cse48 (div .cse51 10))) (let ((.cse46 (= .cse48 main_~ret~1)) (.cse49 (<= .cse51 21474836470)) (.cse47 (* (- 42949672960) (div (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse40 .cse7 (- 21474836480) .cse8 .cse41 .cse10) 42949672960)))) (or (and .cse46 (<= (div (+ .cse2 (- 42949672951) .cse3 .cse47 .cse21 .cse5 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10) 10) .cse48) .cse49 .cse13) (and (or (and (<= (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10 1) 0) (let ((.cse50 (+ .cse2 .cse3 .cse21 .cse5 9 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10))) (<= (* (div (+ (- 42949672950) .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse40 .cse7 .cse8 .cse41 (* (div .cse50 42949672960) (- 42949672960)) .cse10) 10) 10) .cse50))) (and .cse46 .cse49 .cse13)) (or (<= 0 .cse51) (let ((.cse52 (div (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse40 .cse7 .cse8 .cse41 10 .cse10) 10))) (and (= .cse52 main_~ret~1) (<= (div (+ (- 42949672950) .cse2 .cse3 .cse47 .cse21 .cse5 main_~temp~0 .cse40 .cse7 .cse8 .cse41 .cse10) 10) .cse52) .cse13)))))))) (<= main_~i~2 8) .cse17) (let ((.cse54 (select .cse62 (+ .cse18 12)))) (let ((.cse60 (+ .cse2 .cse29 .cse4 .cse5 .cse54 main_~temp~0 .cse55 .cse7 .cse9 .cse10))) (let ((.cse56 (+ .cse2 .cse29 .cse4 .cse5 .cse54 main_~temp~0 .cse55 .cse7 .cse9 10 .cse10)) (.cse57 (div .cse60 42949672960)) (.cse58 (div .cse60 10))) (and .cse17 (or (let ((.cse53 (div .cse56 10))) (and (= main_~ret~1 .cse53) (<= (div (+ (- 42949672950) .cse2 .cse29 .cse4 .cse5 .cse54 main_~temp~0 .cse55 .cse7 .cse9 (* (- 42949672960) (div (+ .cse2 .cse29 .cse4 .cse5 .cse54 main_~temp~0 .cse55 .cse7 (- 21474836480) .cse9 .cse10) 42949672960)) .cse10) 10) .cse53) .cse13)) (<= (div (+ .cse2 .cse29 (- 42949672951) .cse4 .cse5 .cse54 main_~temp~0 .cse55 (* .cse57 (- 42949672960)) .cse7 .cse9 .cse10) 10) .cse58)) (<= (+ 3 (div (* (- 1) |main_~#x~0.offset|) 4)) main_~i~2) (<= main_~i~2 3) (let ((.cse59 (= main_~ret~1 .cse58))) (or (and .cse59 (<= .cse56 0) (<= 0 (+ .cse2 .cse29 .cse4 .cse5 .cse54 main_~temp~0 .cse55 .cse7 .cse9 .cse10 21474836480)) .cse13) (and .cse59 (<= 0 .cse57) (<= .cse60 21474836470) .cse13) (and (<= (+ .cse2 .cse29 .cse4 .cse5 .cse54 main_~temp~0 .cse55 .cse7 .cse9 .cse10 1) 0) (let ((.cse61 (+ .cse2 .cse29 .cse4 .cse5 .cse54 9 main_~temp~0 .cse55 .cse7 .cse9 .cse10))) (<= (* (div (+ (- 42949672950) .cse2 .cse29 .cse4 (* (- 42949672960) (div .cse61 42949672960)) .cse5 .cse54 main_~temp~0 .cse55 .cse7 .cse9 .cse10) 10) 10) .cse61))))))))) (let ((.cse64 (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse7 .cse8 .cse41 .cse9 .cse10))) (let ((.cse65 (div .cse64 10))) (and (or (and (let ((.cse63 (+ .cse2 .cse3 .cse21 .cse5 9 main_~temp~0 .cse7 .cse8 .cse41 .cse9 .cse10))) (<= (* (div (+ (- 42949672950) .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse7 .cse8 .cse41 .cse9 (* (div .cse63 42949672960) (- 42949672960)) .cse10) 10) 10) .cse63)) (<= (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse7 .cse8 .cse41 .cse9 .cse10 1) 0)) (and (<= .cse64 21474836470) (= main_~ret~1 .cse65) .cse13)) (= .cse18 28) .cse17 (let ((.cse66 (* (div (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse7 (- 21474836480) .cse8 .cse41 .cse9 .cse10) 42949672960) (- 42949672960)))) (or (<= 0 .cse64) (let ((.cse67 (div (+ .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse7 .cse8 .cse41 .cse9 10 .cse10) 10))) (and (<= (div (+ (- 42949672950) .cse2 .cse3 .cse21 .cse5 main_~temp~0 .cse66 .cse7 .cse8 .cse41 .cse9 .cse10) 10) .cse67) (= .cse67 main_~ret~1) .cse13)) (<= (div (+ .cse2 (- 42949672951) .cse3 .cse21 .cse5 main_~temp~0 .cse66 .cse7 .cse8 .cse41 .cse9 .cse10) 10) .cse65)))))) (let ((.cse69 (select .cse62 (+ |main_~#x~0.offset| .cse18 32))) (.cse70 (select .cse62 (+ .cse18 20)))) (let ((.cse72 (+ .cse69 .cse4 .cse70 .cse5 main_~temp~0 .cse55 .cse6 .cse71 .cse30 .cse10))) (let ((.cse73 (div .cse72 10))) (and (or (let ((.cse68 (div (+ .cse69 .cse4 .cse70 .cse5 main_~temp~0 .cse55 .cse6 .cse71 .cse30 10 .cse10) 10))) (and (= main_~ret~1 .cse68) (<= (div (+ (- 42949672950) .cse69 .cse4 .cse70 .cse5 main_~temp~0 .cse55 .cse6 .cse71 .cse30 (* (- 42949672960) (div (+ .cse69 .cse4 .cse70 .cse5 main_~temp~0 .cse55 .cse6 (- 21474836480) .cse71 .cse30 .cse10) 42949672960)) .cse10) 10) .cse68) .cse13)) (and (<= (div (+ (- 42949672951) .cse69 .cse4 .cse70 .cse5 main_~temp~0 .cse55 .cse6 .cse71 .cse30 (* (- 42949672960) (div .cse72 42949672960)) .cse10) 10) .cse73) (<= 0 (+ .cse69 .cse4 .cse70 .cse5 main_~temp~0 .cse55 .cse6 .cse71 .cse30 .cse10 21474836480)) .cse13)) .cse17 (or (and (let ((.cse74 (+ .cse69 .cse4 .cse70 .cse5 9 main_~temp~0 .cse55 .cse6 .cse71 .cse30 .cse10))) (<= (* (div (+ (- 42949672950) .cse69 .cse4 .cse70 .cse5 main_~temp~0 (* (- 42949672960) (div .cse74 42949672960)) .cse55 .cse6 .cse71 .cse30 .cse10) 10) 10) .cse74)) (<= (+ .cse69 .cse4 .cse70 .cse5 main_~temp~0 .cse55 .cse6 .cse71 .cse30 .cse10 1) 0)) (and (= main_~ret~1 .cse73) (<= .cse72 21474836470))) (= .cse18 4))))) (let ((.cse75 (select .cse62 (+ .cse18 16)))) (let ((.cse78 (+ .cse2 .cse29 .cse5 main_~temp~0 .cse75 .cse55 .cse6 .cse71 .cse9 .cse10))) (let ((.cse77 (div .cse78 10))) (and (or (and (<= (+ .cse2 .cse29 .cse5 main_~temp~0 .cse75 .cse55 .cse6 .cse71 .cse9 .cse10 1) 0) (let ((.cse76 (+ .cse2 .cse29 .cse5 9 main_~temp~0 .cse75 .cse55 .cse6 .cse71 .cse9 .cse10))) (<= (* (div (+ (- 42949672950) .cse2 .cse29 .cse5 (* (- 42949672960) (div .cse76 42949672960)) main_~temp~0 .cse75 .cse55 .cse6 .cse71 .cse9 .cse10) 10) 10) .cse76))) (and (= .cse77 main_~ret~1) (<= .cse78 21474836470))) (or (let ((.cse79 (div (+ .cse2 .cse29 .cse5 main_~temp~0 .cse75 .cse55 .cse6 .cse71 .cse9 10 .cse10) 10))) (and (= main_~ret~1 .cse79) (<= (div (+ (- 42949672950) .cse2 .cse29 .cse5 main_~temp~0 .cse75 .cse55 .cse6 .cse71 .cse9 (* (div (+ .cse2 .cse29 .cse5 main_~temp~0 .cse75 .cse55 .cse6 (- 21474836480) .cse71 .cse9 .cse10) 42949672960) (- 42949672960)) .cse10) 10) .cse79) .cse13)) (and (<= 0 (+ .cse2 .cse29 .cse5 main_~temp~0 .cse75 .cse55 .cse6 .cse71 .cse9 .cse10 21474836480)) (<= (div (+ (* (- 42949672960) (div .cse78 42949672960)) .cse2 .cse29 (- 42949672951) .cse5 main_~temp~0 .cse75 .cse55 .cse6 .cse71 .cse9 .cse10) 10) .cse77) .cse13)) .cse17 (= .cse80 .cse18))))) (let ((.cse88 (select .cse62 12)) (.cse90 (select .cse62 8)) (.cse91 (select .cse62 24)) (.cse82 (select .cse62 (+ |main_~#x~0.offset| 36)))) (let ((.cse94 (+ .cse2 .cse3 .cse39 .cse21 .cse40 .cse7 .cse8 .cse41 .cse10 .cse82)) (.cse86 (+ .cse88 .cse3 .cse39 .cse90 .cse21 .cse5 main_~temp~0 .cse40 .cse91 .cse82))) (let ((.cse87 (div .cse86 10)) (.cse84 (* (- 42949672960) (div .cse94 42949672960))) (.cse81 (* (div (+ .cse2 .cse3 .cse39 .cse21 .cse40 .cse7 (- 21474836480) .cse8 .cse41 .cse10 .cse82) 42949672960) (- 42949672960))) (.cse85 (div .cse94 10))) (and (or (let ((.cse83 (div (+ .cse2 .cse3 .cse39 .cse21 .cse40 .cse7 .cse8 .cse41 10 .cse10 .cse82) 10))) (and (<= (div (+ (- 42949672950) .cse2 .cse3 .cse39 .cse21 .cse40 .cse7 .cse8 .cse41 .cse10 .cse81 .cse82) 10) .cse83) (= .cse83 main_~ret~1))) (<= (div (+ .cse2 (- 42949672951) .cse3 .cse39 .cse21 .cse40 .cse7 .cse8 .cse41 .cse10 .cse82 .cse84) 10) .cse85)) (or (and (<= .cse86 21474836470) (= .cse87 main_~ret~1) .cse13) (and (let ((.cse89 (+ .cse88 .cse3 .cse39 .cse90 .cse21 .cse5 9 main_~temp~0 .cse40 .cse91 .cse82))) (<= (* (div (+ (- 42949672950) .cse88 .cse3 (* (div .cse89 42949672960) (- 42949672960)) .cse39 .cse90 .cse21 .cse5 main_~temp~0 .cse40 .cse91 .cse82) 10) 10) .cse89)) (<= (+ .cse88 .cse3 .cse39 .cse90 .cse21 .cse5 main_~temp~0 .cse40 .cse91 .cse82 1) 0))) (or (let ((.cse92 (div (+ .cse88 .cse3 .cse39 .cse90 .cse21 .cse5 main_~temp~0 .cse40 .cse91 10 .cse82) 10))) (and (<= (div (+ (- 42949672950) .cse88 .cse3 .cse39 .cse90 .cse21 .cse5 main_~temp~0 .cse40 .cse91 (* (div (+ .cse88 .cse3 .cse39 .cse90 .cse21 .cse5 main_~temp~0 .cse40 (- 21474836480) .cse91 .cse82) 42949672960) (- 42949672960)) .cse82) 10) .cse92) (= main_~ret~1 .cse92) .cse13)) (<= (div (+ .cse88 (- 42949672951) .cse3 .cse39 .cse90 .cse21 .cse5 (* (- 42949672960) (div .cse86 42949672960)) main_~temp~0 .cse40 .cse91 .cse82) 10) .cse87)) (let ((.cse95 (= main_~ret~1 .cse85))) (or (and (<= (+ .cse2 .cse3 .cse39 .cse21 .cse40 .cse7 .cse8 .cse41 .cse10 .cse82 1) 0) (let ((.cse93 (+ .cse2 .cse3 .cse39 .cse21 9 .cse40 .cse7 .cse8 .cse41 .cse10 .cse82))) (<= (* (div (+ (- 42949672950) .cse2 .cse3 .cse39 .cse21 .cse40 .cse7 .cse8 .cse41 (* (- 42949672960) (div .cse93 42949672960)) .cse10 .cse82) 10) 10) .cse93))) (and (<= .cse94 21474836470) .cse95 (<= (div (+ .cse2 .cse3 .cse39 .cse21 .cse40 .cse7 .cse8 .cse41 .cse10 .cse82 .cse84) 10) .cse85)) (and .cse95 (<= (div (+ .cse2 (- 42949672951) .cse3 .cse39 .cse21 .cse40 .cse7 .cse8 .cse41 .cse10 .cse81 .cse82) 10) .cse85)))) .cse17 (= main_~i~2 0)))))))) [2022-01-31 18:36:00,754 INFO L854 garLoopResultBuilder]: At program point L43-4(lines 43 45) the Hoare annotation is: (let ((.cse17 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse2 (select .cse17 (+ |main_~#x~0.offset| 4))) (.cse4 (select .cse17 (+ |main_~#x~0.offset| 16))) (.cse6 (select .cse17 (+ |main_~#x~0.offset| 20))) (.cse7 (select .cse17 (+ |main_~#x~0.offset| 28))) (.cse8 (select .cse17 (+ |main_~#x~0.offset| 8))) (.cse9 (select .cse17 (+ |main_~#x~0.offset| 12))) (.cse10 (select .cse17 (+ |main_~#x~0.offset| 24))) (.cse11 (select .cse17 0))) (and (< 7 main_~i~2) (let ((.cse5 (select .cse17 (+ |main_~#x~0.offset| 32)))) (let ((.cse14 (+ .cse2 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11))) (let ((.cse12 (div .cse14 10))) (let ((.cse1 (= .cse12 main_~ret~1)) (.cse3 (* (- 42949672960) (div (+ .cse2 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 (- 21474836480) .cse9 .cse10 .cse11) 42949672960))) (.cse13 (= main_~ret~1 main_~ret2~0)) (.cse0 (+ .cse2 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 10 .cse11))) (or (and (<= .cse0 0) .cse1 (<= (div (+ .cse2 .cse3 (- 42949672951) .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11) 10) .cse12) .cse13) (and (or (and .cse1 (<= .cse14 21474836470) .cse13) (and (<= (+ .cse2 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 1) 0) (let ((.cse15 (+ .cse2 .cse4 .cse5 .cse6 9 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11))) (<= (* (div (+ (- 42949672950) .cse2 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 (* (div .cse15 42949672960) (- 42949672960))) 10) 10) .cse15)))) (or (<= 0 .cse14) (let ((.cse16 (div .cse0 10))) (and (= .cse16 main_~ret~1) (<= (div (+ (- 42949672950) .cse2 .cse3 .cse4 .cse5 .cse6 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11) 10) .cse16) .cse13))))))))) (= |main_~#x~0.offset| 0) (let ((.cse25 (* main_~i~2 4))) (let ((.cse20 (select .cse17 (+ |main_~#x~0.offset| .cse25 4)))) (let ((.cse23 (+ .cse2 .cse4 .cse6 .cse20 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11))) (let ((.cse21 (div .cse23 10))) (let ((.cse18 (= .cse21 main_~ret~1)) (.cse19 (* (- 42949672960) (div (+ .cse2 .cse4 .cse6 .cse20 main_~temp~0 .cse7 .cse8 (- 21474836480) .cse9 .cse10 .cse11) 42949672960)))) (or (and .cse18 (<= (div (+ .cse2 (- 42949672951) .cse4 .cse19 .cse6 .cse20 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11) 10) .cse21)) (and (or (and (<= (+ .cse2 .cse4 .cse6 .cse20 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11 1) 0) (let ((.cse22 (+ .cse2 .cse4 .cse6 .cse20 9 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11))) (<= (* (div (+ (- 42949672950) .cse2 .cse4 .cse6 .cse20 main_~temp~0 .cse7 .cse8 .cse9 .cse10 (* (div .cse22 42949672960) (- 42949672960)) .cse11) 10) 10) .cse22))) (and .cse18 (<= .cse23 21474836470))) (or (<= 0 .cse23) (let ((.cse24 (div (+ .cse2 .cse4 .cse6 .cse20 main_~temp~0 .cse7 .cse8 .cse9 .cse10 10 .cse11) 10))) (and (= .cse24 main_~ret~1) (<= (div (+ (- 42949672950) .cse2 .cse4 .cse19 .cse6 .cse20 main_~temp~0 .cse7 .cse8 .cse9 .cse10 .cse11) 10) .cse24))))) (not (= .cse25 32))))))))))) [2022-01-31 18:36:00,754 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 18:36:00,754 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 18:36:00,754 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 18:36:00,754 INFO L854 garLoopResultBuilder]: At program point avgEXIT(lines 15 24) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |avg_#in~x.base|))) (let ((.cse15 (select .cse12 (+ 36 |avg_#in~x.offset|))) (.cse16 (select .cse12 (+ 28 |avg_#in~x.offset|))) (.cse17 (select .cse12 (+ 32 |avg_#in~x.offset|))) (.cse18 (select .cse12 |avg_#in~x.offset|)) (.cse19 (select .cse12 (+ |avg_#in~x.offset| 4))) (.cse5 (select .cse12 8)) (.cse20 (select .cse12 (+ 16 |avg_#in~x.offset|))) (.cse8 (select .cse12 24)) (.cse10 (select .cse12 12)) (.cse21 (select .cse12 (+ 20 |avg_#in~x.offset|)))) (let ((.cse1 (* 10 |avg_#res|)) (.cse13 (<= 1 |avg_#in~x.offset|)) (.cse14 (<= (+ |avg_#in~x.offset| 1) 0)) (.cse22 (+ .cse15 .cse16 .cse17 .cse18 .cse19 .cse5 .cse20 .cse8 .cse10 .cse21))) (and (<= 10 avg_~i~0) (let ((.cse2 (select .cse12 0)) (.cse3 (select .cse12 32)) (.cse4 (select .cse12 20)) (.cse6 (select .cse12 28)) (.cse7 (select .cse12 4)) (.cse9 (select .cse12 16)) (.cse11 (select .cse12 36))) (let ((.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (or (not (= |avg_#in~x.offset| 0)) (<= 0 .cse0) (<= .cse0 .cse1) (<= (+ 42949672961 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) 0)))) (or .cse13 .cse14 (and (or (<= (+ 42949672961 .cse15 .cse16 .cse17 .cse18 .cse19 .cse5 .cse20 .cse8 .cse10 .cse21) 0) (<= 21474836480 .cse22) (and (<= .cse22 (+ 9 .cse1)) (or (<= .cse1 (+ .cse15 .cse16 .cse17 .cse18 9 .cse19 .cse5 .cse20 .cse8 .cse10 .cse21)) (<= (+ .cse15 .cse16 .cse17 .cse18 .cse19 21474836490 .cse5 .cse20 .cse8 .cse10 .cse21) 0)))) (or (<= .cse1 .cse22) (<= (+ .cse15 .cse16 .cse17 .cse18 .cse19 .cse5 .cse20 .cse8 .cse10 .cse21 1) 0)))) (or .cse13 .cse14 (and (<= avg_~ret~0 .cse22) (<= .cse22 avg_~ret~0))))))) [2022-01-31 18:36:00,754 INFO L854 garLoopResultBuilder]: At program point L20-2(lines 20 22) the Hoare annotation is: (let ((.cse15 (select |#memory_int| avg_~x.base))) (let ((.cse11 (not (= avg_~x.offset 0))) (.cse14 (select .cse15 (+ avg_~x.offset 24))) (.cse16 (select .cse15 0)) (.cse17 (select .cse15 (+ 12 avg_~x.offset))) (.cse18 (select .cse15 (+ 8 avg_~x.offset))) (.cse19 (select .cse15 (+ 20 avg_~x.offset))) (.cse2 (select .cse15 8)) (.cse13 (select .cse15 (+ 16 avg_~x.offset))) (.cse10 (select .cse15 12)) (.cse6 (<= (+ avg_~x.offset 1) 0)) (.cse7 (<= 1 avg_~x.offset)) (.cse0 (= |avg_#in~x.base| avg_~x.base)) (.cse8 (= |avg_#in~x.offset| avg_~x.offset)) (.cse3 (select .cse15 avg_~x.offset)) (.cse4 (select .cse15 (+ (* 4 avg_~i~0) avg_~x.offset))) (.cse5 (select .cse15 (+ 4 avg_~x.offset)))) (or (and (<= avg_~i~0 3) .cse0 (<= 3 avg_~i~0) (or (let ((.cse1 (+ .cse2 .cse3 .cse4 .cse5))) (and (<= .cse1 avg_~ret~0) (<= avg_~ret~0 .cse1))) .cse6 .cse7) .cse8) (and (or .cse6 (let ((.cse9 (+ .cse2 .cse3 .cse4 .cse10 .cse5))) (and (<= avg_~ret~0 .cse9) (<= .cse9 avg_~ret~0))) .cse7) .cse0 (<= 4 avg_~i~0) (<= avg_~i~0 4) .cse8) (and (<= 8 avg_~i~0) (or .cse11 (let ((.cse12 (+ .cse13 .cse14 (select .cse15 (+ 28 avg_~x.offset)) .cse16 .cse4 .cse5 .cse17 .cse18 .cse19))) (and (<= .cse12 avg_~ret~0) (<= avg_~ret~0 .cse12)))) .cse0 (<= avg_~i~0 8) .cse8) (let ((.cse20 (+ .cse3 .cse4))) (and (<= avg_~ret~0 .cse20) (<= .cse20 avg_~ret~0) .cse0 (<= 1 avg_~i~0) (<= avg_~i~0 1) .cse8)) (and (<= 7 avg_~i~0) (<= avg_~i~0 7) .cse0 (or .cse11 (let ((.cse21 (+ .cse13 .cse14 .cse16 .cse4 .cse5 .cse17 .cse18 .cse19))) (and (<= avg_~ret~0 .cse21) (<= .cse21 avg_~ret~0)))) .cse8) (and (<= 9 avg_~i~0) (<= avg_~i~0 9) (or (<= 1 |avg_#in~x.offset|) (<= (+ |avg_#in~x.offset| 1) 0) (let ((.cse22 (let ((.cse23 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse23 (+ 36 |avg_#in~x.offset|)) (select .cse23 (+ 28 |avg_#in~x.offset|)) (select .cse23 (+ 32 |avg_#in~x.offset|)) (select .cse23 |avg_#in~x.offset|) (select .cse23 (+ |avg_#in~x.offset| 4)) (select .cse23 8) (select .cse23 (+ 16 |avg_#in~x.offset|)) (select .cse23 24) (select .cse23 12) (select .cse23 (+ 20 |avg_#in~x.offset|)))))) (and (<= avg_~ret~0 .cse22) (<= .cse22 avg_~ret~0))))) (and (or .cse6 (let ((.cse24 (+ .cse2 .cse3 .cse13 .cse4 .cse10 .cse5 .cse19))) (and (<= avg_~ret~0 .cse24) (<= .cse24 avg_~ret~0))) .cse7) (<= avg_~i~0 6) (<= 6 avg_~i~0) .cse0 .cse8) (and (<= 0 avg_~i~0) (<= avg_~ret~0 .cse4) .cse0 (<= .cse4 avg_~ret~0) (<= avg_~i~0 0) .cse8) (and (or (let ((.cse25 (+ .cse2 .cse3 .cse13 .cse4 .cse10 .cse5))) (and (<= .cse25 avg_~ret~0) (<= avg_~ret~0 .cse25))) .cse6 .cse7) (<= 5 avg_~i~0) .cse0 (<= avg_~i~0 5) .cse8) (let ((.cse26 (+ .cse3 .cse4 .cse5))) (and (<= avg_~ret~0 .cse26) (<= 2 avg_~i~0) .cse0 (<= avg_~i~0 2) (<= .cse26 avg_~ret~0) .cse8))))) [2022-01-31 18:36:00,755 INFO L854 garLoopResultBuilder]: At program point avgFINAL(lines 15 24) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |avg_#in~x.base|))) (let ((.cse15 (select .cse12 (+ 36 |avg_#in~x.offset|))) (.cse16 (select .cse12 (+ 28 |avg_#in~x.offset|))) (.cse17 (select .cse12 (+ 32 |avg_#in~x.offset|))) (.cse18 (select .cse12 |avg_#in~x.offset|)) (.cse19 (select .cse12 (+ |avg_#in~x.offset| 4))) (.cse5 (select .cse12 8)) (.cse20 (select .cse12 (+ 16 |avg_#in~x.offset|))) (.cse8 (select .cse12 24)) (.cse10 (select .cse12 12)) (.cse21 (select .cse12 (+ 20 |avg_#in~x.offset|)))) (let ((.cse1 (* 10 |avg_#res|)) (.cse13 (<= 1 |avg_#in~x.offset|)) (.cse14 (<= (+ |avg_#in~x.offset| 1) 0)) (.cse22 (+ .cse15 .cse16 .cse17 .cse18 .cse19 .cse5 .cse20 .cse8 .cse10 .cse21))) (and (<= 10 avg_~i~0) (let ((.cse2 (select .cse12 0)) (.cse3 (select .cse12 32)) (.cse4 (select .cse12 20)) (.cse6 (select .cse12 28)) (.cse7 (select .cse12 4)) (.cse9 (select .cse12 16)) (.cse11 (select .cse12 36))) (let ((.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (or (not (= |avg_#in~x.offset| 0)) (<= 0 .cse0) (<= .cse0 .cse1) (<= (+ 42949672961 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) 0)))) (or .cse13 .cse14 (and (or (<= (+ 42949672961 .cse15 .cse16 .cse17 .cse18 .cse19 .cse5 .cse20 .cse8 .cse10 .cse21) 0) (<= 21474836480 .cse22) (and (<= .cse22 (+ 9 .cse1)) (or (<= .cse1 (+ .cse15 .cse16 .cse17 .cse18 9 .cse19 .cse5 .cse20 .cse8 .cse10 .cse21)) (<= (+ .cse15 .cse16 .cse17 .cse18 .cse19 21474836490 .cse5 .cse20 .cse8 .cse10 .cse21) 0)))) (or (<= .cse1 .cse22) (<= (+ .cse15 .cse16 .cse17 .cse18 .cse19 .cse5 .cse20 .cse8 .cse10 .cse21 1) 0)))) (or .cse13 .cse14 (and (<= avg_~ret~0 .cse22) (<= .cse22 avg_~ret~0))))))) [2022-01-31 18:36:00,755 INFO L854 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse10 (select |#memory_int| avg_~x.base))) (let ((.cse13 (select .cse10 (+ 28 avg_~x.offset))) (.cse18 (not (= avg_~x.offset 0))) (.cse12 (select .cse10 (+ avg_~x.offset 24))) (.cse14 (select .cse10 0)) (.cse15 (select .cse10 (+ 12 avg_~x.offset))) (.cse16 (select .cse10 (+ 8 avg_~x.offset))) (.cse17 (select .cse10 (+ 20 avg_~x.offset))) (.cse11 (select .cse10 (+ 16 avg_~x.offset))) (.cse4 (select .cse10 12)) (.cse6 (<= (+ avg_~x.offset 1) 0)) (.cse7 (<= 1 avg_~x.offset)) (.cse2 (select .cse10 8)) (.cse0 (= |avg_#in~x.base| avg_~x.base)) (.cse8 (= |avg_#in~x.offset| avg_~x.offset)) (.cse3 (select .cse10 avg_~x.offset)) (.cse5 (select .cse10 (+ 4 avg_~x.offset)))) (or (and .cse0 (or (let ((.cse1 (+ .cse2 .cse3 .cse4 .cse5))) (and (<= avg_~ret~0 .cse1) (<= .cse1 avg_~ret~0))) .cse6 .cse7) (<= 4 avg_~i~0) (<= avg_~i~0 4) .cse8) (and (or (let ((.cse9 (+ (select .cse10 (+ 32 avg_~x.offset)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17))) (and (<= avg_~ret~0 .cse9) (<= .cse9 avg_~ret~0))) .cse18) .cse0 (<= 9 avg_~i~0) (<= avg_~i~0 9) .cse8) (and (<= avg_~i~0 6) (or .cse6 (let ((.cse19 (+ .cse2 .cse3 .cse11 .cse4 .cse5 .cse17))) (and (<= avg_~ret~0 .cse19) (<= .cse19 avg_~ret~0))) .cse7) (<= 6 avg_~i~0) .cse0 .cse8) (and (<= 8 avg_~i~0) (or .cse18 (let ((.cse20 (+ .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17))) (and (<= avg_~ret~0 .cse20) (<= .cse20 avg_~ret~0)))) .cse0 (<= avg_~i~0 8) .cse8) (and (<= .cse3 avg_~ret~0) (<= avg_~ret~0 .cse3) .cse0 (<= 1 avg_~i~0) (<= avg_~i~0 1) .cse8) (and (<= 7 avg_~i~0) (<= avg_~i~0 7) .cse0 (or .cse18 (let ((.cse21 (+ .cse11 .cse12 .cse14 .cse5 .cse15 .cse16 .cse17))) (and (<= .cse21 avg_~ret~0) (<= avg_~ret~0 .cse21)))) .cse8) (and (<= 5 avg_~i~0) (or (let ((.cse22 (+ .cse2 .cse3 .cse11 .cse4 .cse5))) (and (<= avg_~ret~0 .cse22) (<= .cse22 avg_~ret~0))) .cse6 .cse7) .cse0 (<= avg_~i~0 5) .cse8) (and (<= avg_~i~0 3) (or .cse6 .cse7 (let ((.cse23 (+ .cse2 .cse3 .cse5))) (and (<= .cse23 avg_~ret~0) (<= avg_~ret~0 .cse23)))) .cse0 (<= 3 avg_~i~0) .cse8) (and (<= 10 avg_~i~0) (or (<= 1 |avg_#in~x.offset|) (<= (+ |avg_#in~x.offset| 1) 0) (let ((.cse24 (let ((.cse25 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse25 (+ 36 |avg_#in~x.offset|)) (select .cse25 (+ 28 |avg_#in~x.offset|)) (select .cse25 (+ 32 |avg_#in~x.offset|)) (select .cse25 |avg_#in~x.offset|) (select .cse25 (+ |avg_#in~x.offset| 4)) (select .cse25 8) (select .cse25 (+ 16 |avg_#in~x.offset|)) (select .cse25 24) (select .cse25 12) (select .cse25 (+ 20 |avg_#in~x.offset|)))))) (and (<= avg_~ret~0 .cse24) (<= .cse24 avg_~ret~0))))) (and (<= avg_~ret~0 0) (<= 0 avg_~i~0) (<= 0 avg_~ret~0) .cse0 (<= avg_~i~0 0) .cse8) (let ((.cse26 (+ .cse3 .cse5))) (and (<= .cse26 avg_~ret~0) (<= avg_~ret~0 .cse26) (<= 2 avg_~i~0) .cse0 (<= avg_~i~0 2) .cse8))))) [2022-01-31 18:36:00,755 INFO L854 garLoopResultBuilder]: At program point L20-4(lines 20 22) the Hoare annotation is: (and (<= 10 avg_~i~0) (or (<= 1 |avg_#in~x.offset|) (<= (+ |avg_#in~x.offset| 1) 0) (let ((.cse0 (let ((.cse1 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse1 (+ 36 |avg_#in~x.offset|)) (select .cse1 (+ 28 |avg_#in~x.offset|)) (select .cse1 (+ 32 |avg_#in~x.offset|)) (select .cse1 |avg_#in~x.offset|) (select .cse1 (+ |avg_#in~x.offset| 4)) (select .cse1 8) (select .cse1 (+ 16 |avg_#in~x.offset|)) (select .cse1 24) (select .cse1 12) (select .cse1 (+ 20 |avg_#in~x.offset|)))))) (and (<= avg_~ret~0 .cse0) (<= .cse0 avg_~ret~0))))) [2022-01-31 18:36:00,755 INFO L861 garLoopResultBuilder]: At program point avgENTRY(lines 15 24) the Hoare annotation is: true [2022-01-31 18:36:00,755 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 18:36:00,755 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 18:36:00,755 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 18:36:00,755 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 18:36:00,757 INFO L732 BasicCegarLoop]: Path program histogram: [27, 3, 1, 1] [2022-01-31 18:36:00,758 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 18:36:00,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 06:36:00 BoogieIcfgContainer [2022-01-31 18:36:00,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 18:36:00,850 INFO L158 Benchmark]: Toolchain (without parser) took 550422.55ms. Allocated memory was 197.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 155.3MB in the beginning and 1.0GB in the end (delta: -856.5MB). Peak memory consumption was 959.1MB. Max. memory is 8.0GB. [2022-01-31 18:36:00,850 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 18:36:00,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.34ms. Allocated memory is still 197.1MB. Free memory was 155.0MB in the beginning and 175.5MB in the end (delta: -20.5MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-01-31 18:36:00,852 INFO L158 Benchmark]: Boogie Preprocessor took 34.13ms. Allocated memory is still 197.1MB. Free memory was 175.5MB in the beginning and 173.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 18:36:00,852 INFO L158 Benchmark]: RCFGBuilder took 244.62ms. Allocated memory is still 197.1MB. Free memory was 173.9MB in the beginning and 162.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 18:36:00,854 INFO L158 Benchmark]: TraceAbstraction took 549920.05ms. Allocated memory was 197.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 161.9MB in the beginning and 1.0GB in the end (delta: -850.0MB). Peak memory consumption was 965.1MB. Max. memory is 8.0GB. [2022-01-31 18:36:00,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 171.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.34ms. Allocated memory is still 197.1MB. Free memory was 155.0MB in the beginning and 175.5MB in the end (delta: -20.5MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.13ms. Allocated memory is still 197.1MB. Free memory was 175.5MB in the beginning and 173.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.62ms. Allocated memory is still 197.1MB. Free memory was 173.9MB in the beginning and 162.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 549920.05ms. Allocated memory was 197.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 161.9MB in the beginning and 1.0GB in the end (delta: -850.0MB). Peak memory consumption was 965.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: 50]: 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 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 549.8s, OverallIterations: 32, TraceHistogramMax: 31, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.0s, AutomataDifference: 67.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 163.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1033 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 937 mSDsluCounter, 1524 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 747 mSDsCounter, 446 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8942 IncrementalHoareTripleChecker+Invalid, 9388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 446 mSolverCounterUnsat, 777 mSDtfsCounter, 8942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 856 GetRequests, 294 SyntacticMatches, 10 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6239 ImplicationChecksByTransitivity, 77.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=30, InterpolantAutomatonStates: 340, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 36 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 433 PreInvPairs, 561 NumberOfFragments, 51102 HoareAnnotationTreeSize, 433 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 31 FomulaSimplificationsInter, 4582 FormulaSimplificationTreeSizeReductionInter, 162.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((((4 + -1 * x / 4 <= i && x == 0) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] <= 8589934588) && i <= 4) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 8589934592 + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) || (((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 21474836470 && 10 <= i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + 21474836480 + unknown-#memory_int-unknown[x][x + 36]) && x == 0)) || (x == 0 && i == 0)) || ((((i <= 1 && 0 <= unknown-#memory_int-unknown[x][0] + 2147483648) && 1 + -1 * x / 4 <= i) && x == 0) && unknown-#memory_int-unknown[x][0] <= 2147483647)) || ((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][0] <= 4294967294 && i <= 2) && x == 0) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 4294967296 + unknown-#memory_int-unknown[x][0]) && 2 <= i)) || ((((i <= 8 && 8 + -1 * x / 4 <= i) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] <= 17179869176) && x == 0) && 0 <= 17179869184 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0])) || ((((i <= 5 && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + 10737418240 + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) && 5 + -1 * x / 4 <= i) && x == 0) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] <= 10737418235)) || ((((0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + 12884901888 + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] <= 12884901882) && 6 + -1 * x / 4 <= i) && x == 0) && i <= 6)) || ((((0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + 19327352832 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] <= 19327352823) && i <= 9) && 9 <= i) && x == 0)) || ((((i <= 7 && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] <= 15032385529) && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + 15032385536 + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) && 7 + -1 * x / 4 <= i) && x == 0)) || ((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] <= 6442450941 && i <= 3) && x == 0) && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + 6442450944 + unknown-#memory_int-unknown[x][0]) && 3 <= i) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((((((((ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 && (-42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + 4] + -42949672951 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0] <= 0) && ret == ret2) || ((((ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10 && (-42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + -42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2) || 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) && ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) || ((ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 21474836470) && ret == ret2)))) && x == 0) && i * 4 == 20) || ((i * 4 == 24 && ((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0] <= 0 && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 == ret) && (unknown-#memory_int-unknown[x][x + 4] + -42949672951 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2) || (((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 21474836470) && ret == ret2) || ((-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0)) && ((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10 == ret && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2) || 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0])))) && x == 0)) || ((((((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + 10 + unknown-#memory_int-unknown[x][0]) / 10 == ret && (-42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 42949672960) + -42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + 10 + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2) || 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) || (-42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + -42949672951 + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 10) && (((-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][0]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] + 1 <= 0) || ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] <= 21474836470 && ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2))) && i * 4 == 16) && i * 4 == x + 16)) || (((7 < i && ((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 10 + unknown-#memory_int-unknown[x][0] <= 0 && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10 == ret) && (unknown-#memory_int-unknown[x][x + 4] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 42949672960) + -42949672951 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2) || (((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] <= 21474836470) && ret == ret2) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + 9 + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + 9 + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0])) && (0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] || (((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 10 + unknown-#memory_int-unknown[x][0]) / 10 == ret && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 10 + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2))))) && !(i * 4 == 32)) && x == 0)) || (((7 < i && (((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10 == ret && (unknown-#memory_int-unknown[x][x + 4] + -42949672951 + unknown-#memory_int-unknown[x][x + 16] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] <= 21474836470) && ret == ret2) || (((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][0]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) || (((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] <= 21474836470) && ret == ret2)) && (0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] || (((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 10 + unknown-#memory_int-unknown[x][0]) / 10 == ret && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 10 + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2))))) && i <= 8) && x == 0)) || ((((x == 0 && (((ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10 && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + -42949672951 + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10)) && 3 + -1 * x / 4 <= i) && i <= 3) && (((((ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0] <= 0) && 0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 21474836480) && ret == ret2) || (((ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 && 0 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 21474836470) && ret == ret2)) || (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + unknown-#memory_int-unknown[x][i * 4 + 12] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0])))) || ((((((-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][0]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0) || ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 21474836470 && ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2)) && i * 4 == 28) && x == 0) && ((0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] || (((-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10 && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10 == ret) && ret == ret2)) || (unknown-#memory_int-unknown[x][x + 4] + -42949672951 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10))) || ((((((ret == (unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10 && (-42949672950 + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + -42949672960 * ((unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + -21474836480 + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2) || (((-42949672951 + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + -42949672960 * ((unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 && 0 <= unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 21474836480) && ret == ret2)) && x == 0) && (((-42949672950 + unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + -42949672960 * ((unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] && unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0) || (ret == (unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 && unknown-#memory_int-unknown[x][x + i * 4 + 32] + unknown-#memory_int-unknown[x][x + i * 4 + 16] + unknown-#memory_int-unknown[x][i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 21474836470))) && i * 4 == 4)) || (((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) || ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 21474836470)) && (((ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10 && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + -21474836480 + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + 10 + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2) || ((0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 21474836480 && (-42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 42949672960) + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + -42949672951 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + i * 4 + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 24] + unknown-#memory_int-unknown[x][x + i * 4 + 12] + unknown-#memory_int-unknown[x][x + i * 4 + 28] + unknown-#memory_int-unknown[x][x + i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 10) && ret == ret2))) && x == 0) && x + 8 == i * 4)) || ((((((((-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][x + 36]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 10 + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 10 && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + 10 + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 10 == ret) || (unknown-#memory_int-unknown[x][x + 4] + -42949672951 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 42949672960)) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 10) && (((unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36] <= 21474836470 && (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36]) / 10 == ret) && ret == ret2) || ((-42949672950 + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36]) / 10 * 10 <= unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + 9 + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36] && unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36] + 1 <= 0))) && ((((-42949672950 + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + -21474836480 + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][x + 36]) / 10 <= (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + 10 + unknown-#memory_int-unknown[x][x + 36]) / 10 && ret == (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + 10 + unknown-#memory_int-unknown[x][x + 36]) / 10) && ret == ret2) || (unknown-#memory_int-unknown[x][12] + -42949672951 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + -42949672960 * ((unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36]) / 42949672960) + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36]) / 10 <= (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][x + 36]) / 10)) && (((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + 1 <= 0 && (-42949672950 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + 9 + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 42949672960) + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 10 * 10 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + 9 + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) || ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] <= 21474836470 && ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 10) && (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36] + -42949672960 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 42949672960)) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 10)) || (ret == (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 10 && (unknown-#memory_int-unknown[x][x + 4] + -42949672951 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 42949672960 * -42949672960 + unknown-#memory_int-unknown[x][x + 36]) / 10 <= (unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 32] + unknown-#memory_int-unknown[x][x + 20] + unknown-#memory_int-unknown[x][x + 28] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][x + 36]) / 10))) && x == 0) && i == 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((x == x && (((ret <= unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][4 + x] && unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][4 + x] <= ret) || x + 1 <= 0) || 1 <= x)) && 4 <= i) && i <= 4) && x == x) || ((((((ret <= unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] && unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret) || !(x == 0)) && x == x) && 9 <= i) && i <= 9) && x == x)) || ((((i <= 6 && ((x + 1 <= 0 || (ret <= unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][20 + x] && unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret)) || 1 <= x)) && 6 <= i) && x == x) && x == x)) || ((((8 <= i && (!(x == 0) || (ret <= unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] && unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret))) && x == x) && i <= 8) && x == x)) || (((((unknown-#memory_int-unknown[x][x] <= ret && ret <= unknown-#memory_int-unknown[x][x]) && x == x) && 1 <= i) && i <= 1) && x == x)) || ((((7 <= i && i <= 7) && x == x) && (!(x == 0) || (unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x] <= ret && ret <= unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x + 24] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][20 + x]))) && x == x)) || ((((5 <= i && (((ret <= unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][4 + x] && unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][4 + x] <= ret) || x + 1 <= 0) || 1 <= x)) && x == x) && i <= 5) && x == x)) || ((((i <= 3 && ((x + 1 <= 0 || 1 <= x) || (unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] <= ret && ret <= unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x]))) && x == x) && 3 <= i) && x == x)) || (10 <= i && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] && unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] <= ret)))) || (((((ret <= 0 && 0 <= i) && 0 <= ret) && x == x) && i <= 0) && x == x)) || (((((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] <= ret && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x]) && 2 <= i) && x == x) && i <= 2) && x == x) - ProcedureContractResult [Line: 15]: Procedure Contract for avg Derived contract for procedure avg: ((10 <= i && (((!(x == 0) || 0 <= unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][32] + unknown-#memory_int-unknown[x][20] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][16] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][36]) || unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][32] + unknown-#memory_int-unknown[x][20] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][16] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][36] <= 10 * \result) || 42949672961 + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][32] + unknown-#memory_int-unknown[x][20] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][28] + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][16] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][36] <= 0)) && ((1 <= x || x + 1 <= 0) || (((42949672961 + unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] <= 0 || 21474836480 <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x]) || (unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] <= 9 + 10 * \result && (10 * \result <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + 9 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] || unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + 21474836490 + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] <= 0))) && (10 * \result <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] || unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] + 1 <= 0)))) && ((1 <= x || x + 1 <= 0) || (ret <= unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] && unknown-#memory_int-unknown[x][36 + x] + unknown-#memory_int-unknown[x][28 + x] + unknown-#memory_int-unknown[x][32 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][24] + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][20 + x] <= ret)) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 18:36:00,924 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...