/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/avg05-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 18:26:34,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 18:26:34,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 18:26:34,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 18:26:34,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 18:26:34,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 18:26:34,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 18:26:34,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 18:26:34,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 18:26:34,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 18:26:34,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 18:26:34,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 18:26:34,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 18:26:34,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 18:26:34,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 18:26:34,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 18:26:34,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 18:26:34,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 18:26:34,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 18:26:34,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 18:26:34,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 18:26:34,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 18:26:34,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 18:26:34,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 18:26:34,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 18:26:34,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 18:26:34,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 18:26:34,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 18:26:34,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 18:26:34,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 18:26:34,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 18:26:34,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 18:26:34,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 18:26:34,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 18:26:34,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 18:26:34,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 18:26:34,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 18:26:34,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 18:26:34,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 18:26:34,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 18:26:34,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 18:26:34,332 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:34,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 18:26:34,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 18:26:34,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 18:26:34,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 18:26:34,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 18:26:34,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 18:26:34,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 18:26:34,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 18:26:34,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 18:26:34,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 18:26:34,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 18:26:34,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 18:26:34,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 18:26:34,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 18:26:34,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 18:26:34,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 18:26:34,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 18:26:34,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 18:26:34,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 18:26:34,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 18:26:34,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 18:26:34,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 18:26:34,344 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 18:26:34,344 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:34,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 18:26:34,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 18:26:34,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 18:26:34,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 18:26:34,539 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 18:26:34,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg05-1.i [2022-01-31 18:26:34,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651edd33d/27f66d0b28074e4989eba26508d79da9/FLAG466b68c99 [2022-01-31 18:26:35,018 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 18:26:35,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg05-1.i [2022-01-31 18:26:35,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651edd33d/27f66d0b28074e4989eba26508d79da9/FLAG466b68c99 [2022-01-31 18:26:35,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/651edd33d/27f66d0b28074e4989eba26508d79da9 [2022-01-31 18:26:35,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 18:26:35,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 18:26:35,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 18:26:35,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 18:26:35,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 18:26:35,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 06:26:35" (1/1) ... [2022-01-31 18:26:35,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c930570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:35, skipping insertion in model container [2022-01-31 18:26:35,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 06:26:35" (1/1) ... [2022-01-31 18:26:35,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 18:26:35,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 18:26:35,235 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/avg05-1.i[1275,1288] [2022-01-31 18:26:35,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 18:26:35,242 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 18:26:35,266 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/avg05-1.i[1275,1288] [2022-01-31 18:26:35,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 18:26:35,275 INFO L208 MainTranslator]: Completed translation [2022-01-31 18:26:35,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:35 WrapperNode [2022-01-31 18:26:35,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 18:26:35,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 18:26:35,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 18:26:35,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 18:26:35,284 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:35" (1/1) ... [2022-01-31 18:26:35,284 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:35" (1/1) ... [2022-01-31 18:26:35,294 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:35" (1/1) ... [2022-01-31 18:26:35,295 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:35" (1/1) ... [2022-01-31 18:26:35,305 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:35" (1/1) ... [2022-01-31 18:26:35,309 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:35" (1/1) ... [2022-01-31 18:26:35,315 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:35" (1/1) ... [2022-01-31 18:26:35,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 18:26:35,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 18:26:35,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 18:26:35,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 18:26:35,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:35" (1/1) ... [2022-01-31 18:26:35,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 18:26:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 18:26:35,352 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:35,378 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:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 18:26:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 18:26:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 18:26:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2022-01-31 18:26:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 18:26:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 18:26:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 18:26:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 18:26:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 18:26:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 18:26:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 18:26:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 18:26:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 18:26:35,454 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 18:26:35,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 18:26:35,584 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 18:26:35,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 18:26:35,588 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 18:26:35,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 06:26:35 BoogieIcfgContainer [2022-01-31 18:26:35,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 18:26:35,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 18:26:35,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 18:26:35,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 18:26:35,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 06:26:35" (1/3) ... [2022-01-31 18:26:35,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0e888d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 06:26:35, skipping insertion in model container [2022-01-31 18:26:35,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 06:26:35" (2/3) ... [2022-01-31 18:26:35,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0e888d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 06:26:35, skipping insertion in model container [2022-01-31 18:26:35,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 06:26:35" (3/3) ... [2022-01-31 18:26:35,595 INFO L111 eAbstractionObserver]: Analyzing ICFG avg05-1.i [2022-01-31 18:26:35,599 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 18:26:35,599 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 18:26:35,624 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 18:26:35,628 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:35,628 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 18:26:35,636 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:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 18:26:35,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:35,642 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:35,642 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -56143050, now seen corresponding path program 1 times [2022-01-31 18:26:35,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:35,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1914431600] [2022-01-31 18:26:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:35,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:35,708 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 18:26:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 18:26:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:26:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:35,857 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:35,858 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:35,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1914431600] [2022-01-31 18:26:35,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1914431600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:35,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:35,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 18:26:35,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319553453] [2022-01-31 18:26:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:35,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 18:26:35,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:35,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 18:26:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 18:26:35,890 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:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:35,928 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-01-31 18:26:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 18:26:35,935 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:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:35,939 INFO L225 Difference]: With dead ends: 54 [2022-01-31 18:26:35,939 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 18:26:35,941 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:35,943 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:35,944 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:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 18:26:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 18:26:35,966 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:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-31 18:26:35,967 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2022-01-31 18:26:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:35,968 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-31 18:26:35,968 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:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-31 18:26:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 18:26:35,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:35,969 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:35,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 18:26:35,970 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash 809042352, now seen corresponding path program 1 times [2022-01-31 18:26:35,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:35,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [185431764] [2022-01-31 18:26:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:35,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:35,973 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 18:26:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 18:26:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 18:26:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,077 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:36,077 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:36,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [185431764] [2022-01-31 18:26:36,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [185431764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:36,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:36,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:26:36,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383768326] [2022-01-31 18:26:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:36,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:26:36,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:26:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:36,082 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:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:36,175 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-01-31 18:26:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:26:36,176 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:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:36,177 INFO L225 Difference]: With dead ends: 48 [2022-01-31 18:26:36,177 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 18:26:36,181 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:36,184 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:36,184 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:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 18:26:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-01-31 18:26:36,201 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:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-31 18:26:36,202 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 32 [2022-01-31 18:26:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:36,202 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-31 18:26:36,202 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:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-31 18:26:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 18:26:36,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:36,203 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:36,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 18:26:36,203 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1356290064, now seen corresponding path program 1 times [2022-01-31 18:26:36,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:36,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1950579029] [2022-01-31 18:26:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:36,220 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:36,220 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:36,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:36,224 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 18:26:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 18:26:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 18:26:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,343 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:36,343 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:36,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1950579029] [2022-01-31 18:26:36,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1950579029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:36,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:36,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:26:36,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674415921] [2022-01-31 18:26:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:36,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:26:36,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:26:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:36,345 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:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:36,423 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-31 18:26:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:26:36,424 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:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:36,425 INFO L225 Difference]: With dead ends: 50 [2022-01-31 18:26:36,425 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 18:26:36,426 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:36,431 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:36,432 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:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 18:26:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-31 18:26:36,444 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:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-31 18:26:36,445 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 40 [2022-01-31 18:26:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:36,446 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-31 18:26:36,446 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:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-31 18:26:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 18:26:36,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:36,449 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:36,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 18:26:36,449 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:36,450 INFO L85 PathProgramCache]: Analyzing trace with hash 232330066, now seen corresponding path program 2 times [2022-01-31 18:26:36,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:36,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [976656888] [2022-01-31 18:26:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:36,454 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:36,455 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:36,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:36,456 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:26:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 18:26:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-31 18:26:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,555 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:36,555 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:36,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [976656888] [2022-01-31 18:26:36,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [976656888] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:36,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:36,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:26:36,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147356129] [2022-01-31 18:26:36,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:36,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:26:36,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:36,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:26:36,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:36,557 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:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:36,616 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-01-31 18:26:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:26:36,616 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:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:36,617 INFO L225 Difference]: With dead ends: 51 [2022-01-31 18:26:36,617 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 18:26:36,618 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:36,623 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:36,624 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.0s Time] [2022-01-31 18:26:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 18:26:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-31 18:26:36,632 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:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 18:26:36,635 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 42 [2022-01-31 18:26:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:36,636 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 18:26:36,636 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:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 18:26:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 18:26:36,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:36,638 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:36,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 18:26:36,638 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 541580336, now seen corresponding path program 3 times [2022-01-31 18:26:36,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:36,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997470973] [2022-01-31 18:26:36,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:36,644 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:36,647 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:36,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:36,648 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:26:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:26:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 18:26:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,774 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:36,775 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:36,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997470973] [2022-01-31 18:26:36,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [997470973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:36,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:36,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 18:26:36,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435038946] [2022-01-31 18:26:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:36,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 18:26:36,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:36,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 18:26:36,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 18:26:36,777 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:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:36,831 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-31 18:26:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 18:26:36,832 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:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:36,834 INFO L225 Difference]: With dead ends: 49 [2022-01-31 18:26:36,834 INFO L226 Difference]: Without dead ends: 34 [2022-01-31 18:26:36,835 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:36,836 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:36,836 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:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-31 18:26:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-31 18:26:36,850 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:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-31 18:26:36,851 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 48 [2022-01-31 18:26:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:36,854 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-31 18:26:36,854 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:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-31 18:26:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 18:26:36,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:36,858 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:36,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 18:26:36,859 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash 831812782, now seen corresponding path program 1 times [2022-01-31 18:26:36,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:36,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1276226661] [2022-01-31 18:26:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:36,863 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:36,863 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:36,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:36,865 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:26:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:26:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 18:26:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:36,992 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:36,993 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1276226661] [2022-01-31 18:26:36,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1276226661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:36,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:36,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 18:26:36,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284832766] [2022-01-31 18:26:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:36,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 18:26:36,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 18:26:36,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 18:26:36,995 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:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:37,054 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-01-31 18:26:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 18:26:37,054 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:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:37,056 INFO L225 Difference]: With dead ends: 51 [2022-01-31 18:26:37,056 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 18:26:37,057 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:37,058 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:37,058 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:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 18:26:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 18:26:37,066 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:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-31 18:26:37,070 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 50 [2022-01-31 18:26:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:37,070 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-31 18:26:37,071 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:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-31 18:26:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 18:26:37,074 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:37,074 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:37,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 18:26:37,074 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash 572319148, now seen corresponding path program 2 times [2022-01-31 18:26:37,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:37,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399154886] [2022-01-31 18:26:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:37,084 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:37,085 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:37,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:37,086 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 18:26:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 18:26:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 18:26:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,205 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:37,205 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:37,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399154886] [2022-01-31 18:26:37,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [399154886] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:37,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:37,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:26:37,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601356374] [2022-01-31 18:26:37,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:37,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:26:37,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:26:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:26:37,214 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:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:37,268 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-01-31 18:26:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:26:37,268 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:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:37,269 INFO L225 Difference]: With dead ends: 62 [2022-01-31 18:26:37,269 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 18:26:37,270 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:37,270 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:37,271 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:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 18:26:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-01-31 18:26:37,275 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:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-01-31 18:26:37,276 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 52 [2022-01-31 18:26:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:37,276 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-01-31 18:26:37,276 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:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-01-31 18:26:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 18:26:37,277 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:37,277 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:37,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 18:26:37,277 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash 179129870, now seen corresponding path program 3 times [2022-01-31 18:26:37,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:37,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12841053] [2022-01-31 18:26:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:37,280 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:37,280 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:37,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:37,282 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 18:26:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 18:26:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 18:26:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,360 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:37,360 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:37,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12841053] [2022-01-31 18:26:37,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [12841053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:37,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:37,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:26:37,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703239206] [2022-01-31 18:26:37,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:37,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:26:37,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:26:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:37,361 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:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:37,444 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-01-31 18:26:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:26:37,444 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:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:37,445 INFO L225 Difference]: With dead ends: 64 [2022-01-31 18:26:37,445 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 18:26:37,448 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:37,448 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:37,449 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.0s Time] [2022-01-31 18:26:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 18:26:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-01-31 18:26:37,462 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:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-31 18:26:37,462 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2022-01-31 18:26:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:37,463 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-31 18:26:37,463 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:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-31 18:26:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 18:26:37,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:37,464 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:37,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 18:26:37,464 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 281355760, now seen corresponding path program 4 times [2022-01-31 18:26:37,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:37,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [533613952] [2022-01-31 18:26:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:37,466 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:37,467 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:37,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:37,469 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 18:26:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 18:26:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 18:26:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,535 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:37,535 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:37,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [533613952] [2022-01-31 18:26:37,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [533613952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:37,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:37,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:26:37,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231503650] [2022-01-31 18:26:37,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:37,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:26:37,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:37,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:26:37,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:26:37,537 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:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:37,614 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-01-31 18:26:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:26:37,614 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:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:37,615 INFO L225 Difference]: With dead ends: 65 [2022-01-31 18:26:37,615 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 18:26:37,615 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:37,615 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:37,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 18:26:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-31 18:26:37,619 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:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-01-31 18:26:37,619 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 56 [2022-01-31 18:26:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:37,619 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-01-31 18:26:37,620 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:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-01-31 18:26:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 18:26:37,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:37,620 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:37,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 18:26:37,620 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash -263811758, now seen corresponding path program 5 times [2022-01-31 18:26:37,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:37,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2090001545] [2022-01-31 18:26:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:37,622 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:37,622 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:37,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:37,623 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:26:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 18:26:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 18:26:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,676 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:37,676 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:37,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2090001545] [2022-01-31 18:26:37,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2090001545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:37,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:37,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:26:37,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220849261] [2022-01-31 18:26:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:37,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:26:37,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:26:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:26:37,677 INFO L87 Difference]: Start difference. First operand 41 states and 45 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:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:37,725 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-01-31 18:26:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:26:37,725 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 58 [2022-01-31 18:26:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:37,725 INFO L225 Difference]: With dead ends: 67 [2022-01-31 18:26:37,725 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 18:26:37,726 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:37,726 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:37,726 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:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 18:26:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 18:26:37,729 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:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-01-31 18:26:37,730 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 58 [2022-01-31 18:26:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:37,730 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-01-31 18:26:37,730 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:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-01-31 18:26:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 18:26:37,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:37,731 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 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:37,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 18:26:37,731 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:37,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2049305552, now seen corresponding path program 6 times [2022-01-31 18:26:37,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:37,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1418763809] [2022-01-31 18:26:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:37,733 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:37,733 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:37,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:37,734 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:26:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 18:26:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 18:26:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,794 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:37,794 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:37,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1418763809] [2022-01-31 18:26:37,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1418763809] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:37,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:37,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:26:37,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161422698] [2022-01-31 18:26:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:37,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:26:37,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:26:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:37,795 INFO L87 Difference]: Start difference. First operand 43 states and 47 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:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:37,859 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-01-31 18:26:37,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:26:37,859 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 64 [2022-01-31 18:26:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:37,860 INFO L225 Difference]: With dead ends: 71 [2022-01-31 18:26:37,860 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 18:26:37,860 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:37,861 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:37,861 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.0s Time] [2022-01-31 18:26:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 18:26:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-01-31 18:26:37,864 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:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-01-31 18:26:37,865 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 64 [2022-01-31 18:26:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:37,865 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-01-31 18:26:37,865 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:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-01-31 18:26:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 18:26:37,866 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:37,866 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 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:37,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 18:26:37,866 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:37,866 INFO L85 PathProgramCache]: Analyzing trace with hash 257277070, now seen corresponding path program 7 times [2022-01-31 18:26:37,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:37,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322841090] [2022-01-31 18:26:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:37,868 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:37,868 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:37,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:37,869 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:26:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 18:26:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 18:26:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:37,928 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:37,928 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:37,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322841090] [2022-01-31 18:26:37,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1322841090] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:37,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:37,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 18:26:37,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976610855] [2022-01-31 18:26:37,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:37,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 18:26:37,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 18:26:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 18:26:37,929 INFO L87 Difference]: Start difference. First operand 45 states and 49 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:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:38,002 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-01-31 18:26:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 18:26:38,002 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 70 [2022-01-31 18:26:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:38,002 INFO L225 Difference]: With dead ends: 74 [2022-01-31 18:26:38,003 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 18:26:38,003 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:38,003 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:38,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 42 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 18:26:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-01-31 18:26:38,007 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:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-01-31 18:26:38,007 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 70 [2022-01-31 18:26:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:38,007 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-01-31 18:26:38,007 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:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-01-31 18:26:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 18:26:38,008 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:38,008 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 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:38,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 18:26:38,008 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2086266476, now seen corresponding path program 8 times [2022-01-31 18:26:38,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:38,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1208283689] [2022-01-31 18:26:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:38,010 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:38,010 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:38,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:38,011 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:26:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:26:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-31 18:26:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-31 18:26:38,060 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:38,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1208283689] [2022-01-31 18:26:38,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1208283689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:38,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:38,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 18:26:38,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695250030] [2022-01-31 18:26:38,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:38,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 18:26:38,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:38,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 18:26:38,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 18:26:38,061 INFO L87 Difference]: Start difference. First operand 47 states and 51 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:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:38,110 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-01-31 18:26:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 18:26:38,110 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 76 [2022-01-31 18:26:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:38,111 INFO L225 Difference]: With dead ends: 71 [2022-01-31 18:26:38,111 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 18:26:38,111 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:38,112 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:38,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 18:26:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-01-31 18:26:38,115 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:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 18:26:38,116 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 76 [2022-01-31 18:26:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:38,116 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 18:26:38,116 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:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 18:26:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 18:26:38,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:38,116 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 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:38,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 18:26:38,117 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1854740458, now seen corresponding path program 9 times [2022-01-31 18:26:38,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:38,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1801622644] [2022-01-31 18:26:38,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:38,118 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:38,118 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:38,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:38,119 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:26:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:26:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:26:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 18:26:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:26:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-31 18:26:38,180 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:26:38,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1801622644] [2022-01-31 18:26:38,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1801622644] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:26:38,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:26:38,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 18:26:38,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198823985] [2022-01-31 18:26:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:26:38,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 18:26:38,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:26:38,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 18:26:38,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 18:26:38,181 INFO L87 Difference]: Start difference. First operand 49 states and 53 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:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:26:38,244 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-01-31 18:26:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 18:26:38,244 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 78 [2022-01-31 18:26:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:26:38,245 INFO L225 Difference]: With dead ends: 72 [2022-01-31 18:26:38,245 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 18:26:38,245 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:38,245 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:26:38,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:26:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 18:26:38,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-01-31 18:26:38,249 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:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-01-31 18:26:38,249 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 78 [2022-01-31 18:26:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:26:38,249 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-01-31 18:26:38,249 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:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-01-31 18:26:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 18:26:38,250 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:26:38,250 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 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:38,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 18:26:38,250 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:26:38,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:26:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1598430744, now seen corresponding path program 10 times [2022-01-31 18:26:38,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:26:38,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289437726] [2022-01-31 18:26:38,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:26:38,252 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:38,252 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:26:38,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:26:38,253 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:26:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:29:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:29:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:29:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:29:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:29:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:29:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:23,388 WARN L228 SmtUtils]: Spent 9.99s on a formula simplification. DAG size of input: 145 DAG size of output: 139 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 18:30:23,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 18:30:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:30:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 24 refuted. 2 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 18:30:36,503 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:30:36,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289437726] [2022-01-31 18:30:36,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [289437726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:30:36,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:30:36,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-01-31 18:30:36,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202330503] [2022-01-31 18:30:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:30:36,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-31 18:30:36,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:30:36,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-31 18:30:36,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2436, Unknown=3, NotChecked=0, Total=2550 [2022-01-31 18:30:36,505 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 51 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 47 states have internal predecessors, (59), 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:22,891 WARN L228 SmtUtils]: Spent 2.64m on a formula simplification. DAG size of input: 272 DAG size of output: 180 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 18:33:48,894 WARN L228 SmtUtils]: Spent 12.46s on a formula simplification. DAG size of input: 232 DAG size of output: 131 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 18:33:50,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 18:34:11,862 WARN L228 SmtUtils]: Spent 19.96s on a formula simplification. DAG size of input: 170 DAG size of output: 154 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 18:34:24,038 WARN L228 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 172 DAG size of output: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 18:34:48,507 WARN L228 SmtUtils]: Spent 20.53s on a formula simplification. DAG size of input: 174 DAG size of output: 149 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 18:34:53,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 18:35:18,520 WARN L228 SmtUtils]: Spent 21.85s on a formula simplification. DAG size of input: 182 DAG size of output: 157 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 18:35:31,211 WARN L228 SmtUtils]: Spent 9.34s on a formula simplification. DAG size of input: 311 DAG size of output: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 18:35:33,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-31 18:35:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:35:34,071 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2022-01-31 18:35:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 18:35:34,071 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 47 states have internal predecessors, (59), 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 80 [2022-01-31 18:35:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:35:34,073 INFO L225 Difference]: With dead ends: 105 [2022-01-31 18:35:34,073 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 18:35:34,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 322.3s TimeCoverageRelationStatistics Valid=311, Invalid=7166, Unknown=5, NotChecked=0, Total=7482 [2022-01-31 18:35:34,076 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 72 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:35:34,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 191 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2269 Invalid, 2 Unknown, 0 Unchecked, 15.0s Time] [2022-01-31 18:35:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 18:35:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2022-01-31 18:35:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 63 states have internal predecessors, (66), 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:35:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2022-01-31 18:35:34,128 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 80 [2022-01-31 18:35:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:35:34,128 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2022-01-31 18:35:34,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 47 states have internal predecessors, (59), 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:35:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-01-31 18:35:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 18:35:34,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:35:34,129 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 5, 5, 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:35:34,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 18:35:34,130 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:35:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:35:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash -146889722, now seen corresponding path program 11 times [2022-01-31 18:35:34,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:35:34,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [200023618] [2022-01-31 18:35:34,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:35:34,132 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:35:34,132 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:35:34,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:35:34,133 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:35:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:35:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 18:35:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 18:35:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 18:35:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 18:35:34,217 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:35:34,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [200023618] [2022-01-31 18:35:34,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [200023618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:35:34,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:35:34,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:35:34,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814146743] [2022-01-31 18:35:34,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:35:34,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:35:34,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:35:34,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:35:34,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:35:34,218 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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:35:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:35:34,322 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-01-31 18:35:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:35:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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 82 [2022-01-31 18:35:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:35:34,323 INFO L225 Difference]: With dead ends: 106 [2022-01-31 18:35:34,323 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 18:35:34,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:35:34,324 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:35:34,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 36 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:35:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 18:35:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-31 18:35:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 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:35:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-01-31 18:35:34,333 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 82 [2022-01-31 18:35:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:35:34,333 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-01-31 18:35:34,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 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:35:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-01-31 18:35:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 18:35:34,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 18:35:34,334 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 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:35:34,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 18:35:34,334 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 18:35:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 18:35:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1454621514, now seen corresponding path program 12 times [2022-01-31 18:35:34,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 18:35:34,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915893393] [2022-01-31 18:35:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 18:35:34,337 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 18:35:34,337 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 18:35:34,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 18:35:34,338 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 18:35:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 18:35:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 18:35:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 18:35:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 18:35:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 18:35:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-31 18:35:34,403 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 18:35:34,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915893393] [2022-01-31 18:35:34,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1915893393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 18:35:34,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 18:35:34,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 18:35:34,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897585260] [2022-01-31 18:35:34,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 18:35:34,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 18:35:34,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 18:35:34,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 18:35:34,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-01-31 18:35:34,404 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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:35:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 18:35:34,458 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-01-31 18:35:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 18:35:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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 82 [2022-01-31 18:35:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 18:35:34,459 INFO L225 Difference]: With dead ends: 53 [2022-01-31 18:35:34,459 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 18:35:34,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-31 18:35:34,459 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 18:35:34,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 18:35:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 18:35:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 18:35:34,460 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:35:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 18:35:34,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2022-01-31 18:35:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 18:35:34,460 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 18:35:34,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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:35:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 18:35:34,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 18:35:34,462 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 18:35:34,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 18:35:34,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 18:35:46,866 WARN L228 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 177 DAG size of output: 174 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 18:36:54,039 WARN L228 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 406 DAG size of output: 395 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 18:37:54,169 WARN L228 SmtUtils]: Spent 59.97s on a formula simplification. DAG size of input: 488 DAG size of output: 473 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-31 18:37:54,176 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 18:37:54,176 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 18:37:54,176 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 18:37:54,176 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 26 53) the Hoare annotation is: true [2022-01-31 18:37:54,176 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: false [2022-01-31 18:37:54,176 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 26 53) the Hoare annotation is: true [2022-01-31 18:37:54,176 INFO L854 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse1 (select .cse9 (+ |main_~#x~0.offset| 4))) (.cse2 (select .cse9 (+ |main_~#x~0.offset| 16))) (.cse4 (select .cse9 (+ |main_~#x~0.offset| 8))) (.cse5 (select .cse9 (+ |main_~#x~0.offset| 12))) (.cse6 (select .cse9 |main_~#x~0.offset|))) (let ((.cse8 (+ .cse1 .cse2 .cse4 .cse5 .cse6))) (and (let ((.cse7 (div .cse8 5)) (.cse0 (<= 0 .cse8)) (.cse3 (* (- 21474836480) (div .cse8 21474836480)))) (or (and (or .cse0 (and (= (div (+ .cse1 (- 21474836475) .cse2 .cse3 .cse4 .cse5 .cse6) 5) |main_#t~ret5|) (<= .cse7 (+ (* (div .cse7 4294967296) 4294967296) (div (+ .cse1 (- 21474836476) .cse2 .cse3 .cse4 .cse5 .cse6) 5) 4294967295)))) (or (<= (+ .cse1 .cse2 .cse4 .cse5 .cse6 1) 0) (<= .cse8 (+ 21474836479 (* (div (+ .cse1 .cse2 .cse4 (* (- 5) |main_#t~ret5|) (- 21474836480) .cse5 .cse6) 21474836480) 21474836480))))) (and (= (div (+ .cse1 (* (div (+ .cse1 .cse2 .cse4 .cse5 4 .cse6) 21474836480) (- 21474836480)) .cse2 .cse4 (- 21474836480) .cse5 .cse6) 5) |main_#t~ret5|) (<= .cse8 (* 5 .cse7))) (and .cse0 (= (div (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) 5) |main_#t~ret5|)))) (<= .cse8 10737418235) (= |main_~#x~0.offset| 0) (<= 0 (+ .cse1 .cse2 10737418240 .cse4 .cse5 .cse6)))))) [2022-01-31 18:37:54,177 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 36) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse4 (= |main_~#x~0.offset| 0)) (.cse3 (select .cse6 (+ |main_~#x~0.offset| (* main_~i~1 4)))) (.cse0 (select .cse6 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse6 (+ |main_~#x~0.offset| 8))) (.cse2 (select .cse6 |main_~#x~0.offset|))) (or (and (<= 0 (+ .cse0 .cse1 .cse2 6442450944)) (<= (+ .cse0 .cse1 .cse2 .cse3) 8589934588) (<= main_~i~1 3) (<= (+ .cse0 .cse1 .cse2) 6442450941) .cse4 (<= 3 main_~i~1) (<= 0 (+ .cse0 8589934592 .cse1 .cse2 .cse3))) (and (<= (+ .cse0 .cse2) 4294967294) (<= main_~i~1 2) .cse4 (<= 2 main_~i~1) (<= 0 (+ .cse0 4294967296 .cse2)) (<= (+ .cse0 .cse2 .cse3) 6442450941) (<= 0 (+ .cse0 .cse2 6442450944 .cse3))) (and (<= 0 (+ .cse2 2147483648)) (<= 1 main_~i~1) (<= 0 (+ 4294967296 .cse2 .cse3)) (<= (+ .cse2 .cse3) 4294967294) (<= .cse2 2147483647) (<= main_~i~1 1) .cse4) (and (<= .cse3 2147483647) (<= 0 (+ 2147483648 .cse3)) .cse4 (= main_~i~1 0)) (let ((.cse5 (select .cse6 (+ |main_~#x~0.offset| 12)))) (and (<= (+ .cse0 .cse1 .cse5 .cse2 .cse3) 10737418235) (<= 4 main_~i~1) .cse4 (<= (+ .cse0 .cse1 .cse5 .cse2) 8589934588) (<= 0 (+ .cse0 10737418240 .cse1 .cse5 .cse2 .cse3)) (<= 0 (+ .cse0 8589934592 .cse1 .cse5 .cse2)) (<= main_~i~1 4)))))) [2022-01-31 18:37:54,177 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) the Hoare annotation is: false [2022-01-31 18:37:54,177 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse3 (select .cse6 (+ |main_~#x~0.offset| 12))) (.cse1 (select .cse6 (+ |main_~#x~0.offset| 4))) (.cse2 (select .cse6 (+ |main_~#x~0.offset| 8))) (.cse4 (select .cse6 |main_~#x~0.offset|)) (.cse0 (= |main_~#x~0.offset| 0))) (or (and (<= 4 main_~i~1) .cse0 (<= (+ .cse1 .cse2 .cse3 .cse4) 8589934588) (<= 0 (+ .cse1 8589934592 .cse2 .cse3 .cse4)) (<= main_~i~1 4)) (let ((.cse5 (select .cse6 (+ |main_~#x~0.offset| 16)))) (and (<= 5 main_~i~1) (<= (+ .cse1 .cse5 .cse2 .cse3 .cse4) 10737418235) .cse0 (<= 0 (+ .cse1 .cse5 10737418240 .cse2 .cse3 .cse4)))) (and (<= (+ .cse1 .cse4) 4294967294) (<= main_~i~1 2) .cse0 (<= 2 main_~i~1) (<= 0 (+ .cse1 4294967296 .cse4))) (and .cse0 (= main_~i~1 0)) (and (<= 0 (+ .cse1 .cse2 .cse4 6442450944)) (<= main_~i~1 3) (<= (+ .cse1 .cse2 .cse4) 6442450941) .cse0 (<= 3 main_~i~1)) (and (<= 0 (+ .cse4 2147483648)) (<= 1 main_~i~1) (<= .cse4 2147483647) (<= main_~i~1 1) .cse0)))) [2022-01-31 18:37:54,177 INFO L854 garLoopResultBuilder]: At program point L34-4(lines 34 36) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse5 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse5 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse5 (+ |main_~#x~0.offset| 8))) (.cse3 (select .cse5 (+ |main_~#x~0.offset| 12))) (.cse4 (select .cse5 |main_~#x~0.offset|))) (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4) 10737418235) (= |main_~#x~0.offset| 0) (<= 0 (+ .cse0 .cse1 10737418240 .cse2 .cse3 .cse4))))) [2022-01-31 18:37:54,177 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 26 53) the Hoare annotation is: true [2022-01-31 18:37:54,177 INFO L854 garLoopResultBuilder]: At program point L49(lines 49 51) the Hoare annotation is: (and (= main_~ret~1 main_~ret5~0) (= main_~ret~1 main_~ret2~0)) [2022-01-31 18:37:54,177 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse3 (select .cse8 4)) (.cse4 (select .cse8 (+ |main_~#x~0.offset| 8))) (.cse5 (select .cse8 (+ |main_~#x~0.offset| 12))) (.cse6 (select .cse8 0))) (and (let ((.cse2 (select .cse8 (+ |main_~#x~0.offset| 16)))) (let ((.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (let ((.cse1 (div .cse0 5))) (or (and (<= .cse0 (* .cse1 5)) (or (= (div (+ (* (div (+ .cse2 .cse3 .cse4 .cse5 4 .cse6) 21474836480) (- 21474836480)) .cse2 .cse3 .cse4 .cse5 .cse6) 5) main_~ret~1) (= (div (+ (* (- 21474836480) (div .cse0 21474836480)) .cse2 .cse3 .cse4 (- 21474836480) .cse5 .cse6) 5) main_~ret~1))) (and (<= .cse0 (+ (* (div (+ (- 1) .cse2 .cse3 .cse4 .cse5 .cse6) 5) 5) 4)) (<= .cse0 10737418235) (or (and (= .cse1 main_~ret~1) (<= 0 .cse0)) (and (<= (+ .cse2 .cse3 .cse4 .cse5 .cse6 1) 0) (let ((.cse7 (div (+ .cse2 5 .cse3 .cse4 .cse5 .cse6) 21474836480))) (or (= main_~ret~1 (div (+ (- 21474836475) .cse2 (* .cse7 (- 21474836480)) .cse3 .cse4 .cse5 .cse6) 5)) (= (+ main_~ret~1 (* .cse7 4294967296)) (+ .cse1 1))))))))))) (= |main_~#x~0.offset| 0) (= (* main_~i~2 4) 16) (let ((.cse10 (+ main_~temp~0 .cse3 .cse4 .cse5 .cse6))) (let ((.cse12 (div .cse10 5)) (.cse11 (= main_~ret~1 main_~ret2~0))) (or (and (let ((.cse9 (* (div (+ main_~temp~0 .cse3 .cse4 .cse5 4 .cse6) 21474836480) (- 21474836480)))) (or (and (= (div (+ main_~temp~0 .cse3 .cse4 .cse9 (- 21474836480) .cse5 .cse6) 5) main_~ret~1) (<= .cse10 (+ 21474836479 (* (div (+ main_~temp~0 .cse3 .cse4 .cse5 (- 10737418236) .cse6) 21474836480) 21474836480))) .cse11) (and (= main_~ret~1 (div (+ main_~temp~0 .cse3 .cse4 .cse9 .cse5 .cse6) 5)) (<= (* (div (+ main_~temp~0 .cse3 .cse4 10737418244 .cse5 .cse6) 21474836480) 21474836480) .cse10) .cse11))) (<= .cse10 (* 5 .cse12))) (and (<= .cse10 (+ (* 5 (div (+ (- 1) main_~temp~0 .cse3 .cse4 .cse5 .cse6) 5)) 4)) (<= .cse10 10737418235) (or (and (<= 0 (* 4294967296 (div .cse12 4294967296))) (= main_~ret~1 .cse12) .cse11) (and (<= (+ main_~temp~0 .cse3 .cse4 .cse5 .cse6 1) 0) (let ((.cse13 (div (+ 5 main_~temp~0 .cse3 .cse4 .cse5 .cse6) 21474836480))) (or (and (= (div (+ (- 21474836475) main_~temp~0 .cse3 .cse4 (* (- 21474836480) .cse13) .cse5 .cse6) 5) main_~ret~1) (<= (+ (* .cse13 21474836480) 10737418235) .cse10)) (let ((.cse14 (+ .cse12 1))) (and (<= .cse12 (+ (* (div .cse14 4294967296) 4294967296) 2147483646)) (= .cse14 (+ (* 4294967296 .cse13) main_~ret~1)))))) .cse11))))))))) [2022-01-31 18:37:54,177 INFO L861 garLoopResultBuilder]: At program point L49-2(lines 49 51) the Hoare annotation is: true [2022-01-31 18:37:54,177 INFO L854 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (and (= |main_#t~ret12| main_~ret~1) (= main_~ret~1 main_~ret2~0)) [2022-01-31 18:37:54,178 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse9 (+ |main_~#x~0.offset| 4))) (.cse1 (select .cse9 (+ |main_~#x~0.offset| 16))) (.cse2 (select .cse9 (+ |main_~#x~0.offset| 8))) (.cse3 (select .cse9 (+ |main_~#x~0.offset| 12))) (.cse4 (select .cse9 |main_~#x~0.offset|))) (let ((.cse8 (+ .cse0 .cse1 .cse2 .cse3 .cse4))) (and (let ((.cse7 (* (- 21474836480) (div .cse8 21474836480)))) (let ((.cse5 (div .cse8 5)) (.cse6 (div (+ .cse0 (- 21474836476) .cse1 .cse7 .cse2 .cse3 .cse4) 5))) (or (and (<= (* (div (+ .cse0 .cse1 5 .cse2 .cse3 .cse4) 21474836480) 21474836480) (+ .cse0 .cse1 .cse2 .cse3 4 .cse4)) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 1) 0) (<= .cse5 (+ (* (div (+ .cse5 1) 4294967296) 4294967296) .cse6 4294967295)) (= (div (+ .cse0 (- 21474836475) .cse1 .cse7 .cse2 .cse3 .cse4) 5) main_~ret~1)) (and (<= 0 .cse8) (= main_~ret~1 .cse5)) (and (= .cse6 main_~ret~1) (<= .cse8 (+ (* (div (+ .cse0 .cse1 .cse2 .cse3 (- 10737418240) .cse4) 21474836480) 21474836480) 21474836475)))))) (<= .cse8 10737418235) (= |main_~#x~0.offset| 0) (<= 0 (+ .cse0 .cse1 10737418240 .cse2 .cse3 .cse4)))))) [2022-01-31 18:37:54,178 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 43 45) the Hoare annotation is: (let ((.cse30 (+ |main_~#x~0.offset| 8)) (.cse31 (* main_~i~2 4)) (.cse16 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse2 (select .cse16 (+ |main_~#x~0.offset| 16))) (.cse11 (= main_~ret~1 main_~ret2~0)) (.cse8 (select .cse16 (+ |main_~#x~0.offset| .cse31 4))) (.cse1 (select .cse16 (+ |main_~#x~0.offset| .cse31))) (.cse20 (select .cse16 4)) (.cse3 (select .cse16 .cse30)) (.cse21 (select .cse16 0)) (.cse15 (= |main_~#x~0.offset| 0))) (or (let ((.cse0 (select .cse16 12))) (and (let ((.cse5 (+ .cse0 .cse1 .cse2 main_~temp~0 .cse3))) (let ((.cse6 (div .cse5 5))) (or (and (let ((.cse4 (* (- 21474836480) (div (+ .cse0 .cse1 .cse2 main_~temp~0 .cse3 4) 21474836480)))) (or (= main_~ret~1 (div (+ .cse0 .cse1 .cse2 main_~temp~0 .cse3 .cse4) 5)) (= (div (+ .cse0 .cse1 .cse2 main_~temp~0 .cse3 (- 21474836480) .cse4) 5) main_~ret~1))) (<= .cse5 (* .cse6 5))) (and (<= .cse5 10737418235) (<= .cse5 (+ (* 5 (div (+ (- 1) .cse0 .cse1 .cse2 main_~temp~0 .cse3) 5)) 4)) (or (and (= .cse6 main_~ret~1) (<= 0 .cse5)) (and (<= (+ .cse0 .cse1 .cse2 main_~temp~0 .cse3 1) 0) (let ((.cse7 (div (+ .cse0 .cse1 .cse2 5 main_~temp~0 .cse3) 21474836480))) (or (= (+ main_~ret~1 (* .cse7 4294967296)) (+ .cse6 1)) (= (div (+ .cse0 .cse1 (- 21474836475) .cse2 (* .cse7 (- 21474836480)) main_~temp~0 .cse3) 5) main_~ret~1))))))))) (let ((.cse10 (+ .cse0 .cse2 .cse8 main_~temp~0 .cse3))) (let ((.cse12 (div .cse10 5))) (or (and (let ((.cse9 (* (div (+ .cse0 .cse2 .cse8 main_~temp~0 .cse3 4) 21474836480) (- 21474836480)))) (or (and (= main_~ret~1 (div (+ .cse0 .cse2 .cse8 main_~temp~0 .cse3 .cse9) 5)) (<= (* (div (+ .cse0 .cse2 .cse8 main_~temp~0 .cse3 10737418244) 21474836480) 21474836480) .cse10) .cse11) (and (= main_~ret~1 (div (+ .cse0 .cse2 .cse8 main_~temp~0 .cse3 (- 21474836480) .cse9) 5)) (<= .cse10 (+ 21474836479 (* 21474836480 (div (+ .cse0 .cse2 .cse8 main_~temp~0 .cse3 (- 10737418236)) 21474836480)))) .cse11))) (<= .cse10 (* 5 .cse12))) (and (<= .cse10 (+ (* (div (+ (- 1) .cse0 .cse2 .cse8 main_~temp~0 .cse3) 5) 5) 4)) (or (and (<= (+ .cse0 .cse2 .cse8 main_~temp~0 .cse3 1) 0) (let ((.cse13 (div (+ .cse0 .cse2 5 .cse8 main_~temp~0 .cse3) 21474836480))) (or (and (= (div (+ (* .cse13 (- 21474836480)) .cse0 (- 21474836475) .cse2 .cse8 main_~temp~0 .cse3) 5) main_~ret~1) (<= (+ (* .cse13 21474836480) 10737418235) .cse10)) (let ((.cse14 (+ 1 .cse12))) (and (= (+ main_~ret~1 (* .cse13 4294967296)) .cse14) (<= .cse12 (+ (* (div .cse14 4294967296) 4294967296) 2147483646)))))) .cse11) (and (<= 0 (* 4294967296 (div .cse12 4294967296))) (= main_~ret~1 .cse12) .cse11)) (<= .cse10 10737418235))))) .cse15 (= main_~i~2 0))) (and .cse15 (let ((.cse17 (+ .cse2 .cse8 main_~temp~0 .cse20 .cse21))) (let ((.cse18 (div .cse17 5))) (or (and (or (and (<= 0 .cse17) (= .cse18 main_~ret~1)) (and (let ((.cse19 (div (+ .cse2 5 .cse8 main_~temp~0 .cse20 .cse21) 21474836480))) (or (= (+ (* 4294967296 .cse19) main_~ret~1) (+ .cse18 1)) (= main_~ret~1 (div (+ (- 21474836475) .cse2 .cse8 main_~temp~0 .cse20 (* (- 21474836480) .cse19) .cse21) 5)))) (<= (+ .cse2 .cse8 main_~temp~0 .cse20 .cse21 1) 0))) (<= .cse17 10737418235) (<= .cse17 (+ (* (div (+ (- 1) .cse2 .cse8 main_~temp~0 .cse20 .cse21) 5) 5) 4))) (and (let ((.cse22 (* (div .cse17 21474836480) (- 21474836480)))) (or (= main_~ret~1 (div (+ .cse22 .cse2 .cse8 main_~temp~0 .cse20 (- 21474836480) .cse21) 5)) (= main_~ret~1 (div (+ .cse22 .cse2 .cse8 main_~temp~0 .cse20 .cse21) 5)))) (<= .cse17 (* .cse18 5)))))) (let ((.cse23 (+ .cse1 .cse2 main_~temp~0 .cse20 .cse21))) (let ((.cse28 (* (- 21474836480) (div .cse23 21474836480)))) (or (and (<= .cse23 10737418235) (let ((.cse26 (div .cse23 5))) (or (and (let ((.cse25 (div (+ .cse1 .cse2 5 main_~temp~0 .cse20 .cse21) 21474836480))) (or (let ((.cse24 (+ .cse26 1))) (and (= .cse24 (+ (* .cse25 4294967296) main_~ret~1)) (<= .cse26 (+ (* (div .cse24 4294967296) 4294967296) 2147483646)))) (and (= main_~ret~1 (div (+ (* (- 21474836480) .cse25) .cse1 (- 21474836475) .cse2 main_~temp~0 .cse20 .cse21) 5)) (<= (+ (* .cse25 21474836480) 10737418235) .cse23)))) (<= (+ .cse1 .cse2 main_~temp~0 .cse20 .cse21 1) 0) .cse11) (and (= .cse26 main_~ret~1) (<= 0 (* (div .cse26 4294967296) 4294967296)) .cse11))) (<= .cse23 (+ (* 5 (div (+ (- 1) .cse1 .cse2 main_~temp~0 .cse20 .cse21) 5)) 4))) (let ((.cse27 (div (+ .cse1 .cse2 main_~temp~0 .cse20 (- 21474836480) .cse28 .cse21) 5))) (and (= main_~ret~1 .cse27) (<= (div (+ .cse1 (- 21474836476) .cse2 main_~temp~0 .cse20 .cse28 .cse21) 5) .cse27) (<= .cse23 (+ 21474836479 (* (div (+ .cse1 .cse2 main_~temp~0 .cse20 (- 10737418240) .cse21) 21474836480) 21474836480))) .cse11)) (let ((.cse29 (div (+ .cse1 .cse2 main_~temp~0 .cse20 .cse28 .cse21) 5))) (and (<= (* (div (+ .cse1 .cse2 main_~temp~0 .cse20 10737418244 .cse21) 21474836480) 21474836480) .cse23) (= main_~ret~1 .cse29) (<= (div (+ .cse1 .cse2 main_~temp~0 .cse20 .cse28 4 .cse21) 5) .cse29) .cse11))))) (= .cse30 .cse31)) (let ((.cse33 (select .cse16 (+ .cse31 8)))) (and (let ((.cse34 (+ .cse2 .cse8 main_~temp~0 .cse33 .cse21))) (let ((.cse35 (div .cse34 5))) (or (and (let ((.cse32 (* (div .cse34 21474836480) (- 21474836480)))) (or (and (= main_~ret~1 (div (+ .cse32 .cse2 .cse8 main_~temp~0 .cse33 .cse21) 5)) (<= (* (div (+ .cse2 .cse8 main_~temp~0 10737418244 .cse33 .cse21) 21474836480) 21474836480) .cse34) .cse11) (and (<= .cse34 (+ 21474836479 (* (div (+ .cse2 .cse8 main_~temp~0 .cse33 (- 10737418240) .cse21) 21474836480) 21474836480))) (= (div (+ .cse32 .cse2 .cse8 main_~temp~0 (- 21474836480) .cse33 .cse21) 5) main_~ret~1) .cse11))) (<= .cse34 (* 5 .cse35))) (and (<= .cse34 (+ (* 5 (div (+ (- 1) .cse2 .cse8 main_~temp~0 .cse33 .cse21) 5)) 4)) (or (and (<= (+ .cse2 .cse8 main_~temp~0 .cse33 .cse21 1) 0) (let ((.cse36 (div (+ .cse2 5 .cse8 main_~temp~0 .cse33 .cse21) 21474836480))) (or (and (<= (+ (* 21474836480 .cse36) 10737418235) .cse34) (= main_~ret~1 (div (+ (- 21474836475) .cse2 .cse8 main_~temp~0 .cse33 (* (- 21474836480) .cse36) .cse21) 5))) (let ((.cse37 (+ .cse35 1))) (and (= .cse37 (+ main_~ret~1 (* 4294967296 .cse36))) (<= .cse35 (+ (* (div .cse37 4294967296) 4294967296) 2147483646)))))) .cse11) (and (= main_~ret~1 .cse35) (<= 0 (* 4294967296 (div .cse35 4294967296))) .cse11)) (<= .cse34 10737418235))))) .cse15 (let ((.cse38 (+ .cse1 .cse2 main_~temp~0 .cse33 .cse21))) (let ((.cse39 (div .cse38 5))) (or (and (<= .cse38 (* .cse39 5)) (or (= main_~ret~1 (div (+ .cse1 .cse2 (* (div (+ .cse1 .cse2 main_~temp~0 .cse33 4 .cse21) 21474836480) (- 21474836480)) main_~temp~0 (- 21474836480) .cse33 .cse21) 5)) (= main_~ret~1 (div (+ .cse1 .cse2 main_~temp~0 .cse33 (* (div .cse38 21474836480) (- 21474836480)) .cse21) 5)))) (and (or (and (<= 0 .cse38) (= .cse39 main_~ret~1)) (and (<= (+ .cse1 .cse2 main_~temp~0 .cse33 .cse21 1) 0) (let ((.cse40 (div (+ .cse1 .cse2 5 main_~temp~0 .cse33 .cse21) 21474836480))) (or (= (div (+ .cse1 (- 21474836475) .cse2 main_~temp~0 .cse33 .cse21 (* .cse40 (- 21474836480))) 5) main_~ret~1) (= (+ main_~ret~1 (* .cse40 4294967296)) (+ .cse39 1)))))) (<= .cse38 (+ (* (div (+ (- 1) .cse1 .cse2 main_~temp~0 .cse33 .cse21) 5) 5) 4)) (<= .cse38 10737418235))))) (= .cse31 4))) (and (let ((.cse42 (+ .cse8 main_~temp~0 .cse20 .cse3 .cse21))) (let ((.cse43 (* (div .cse42 21474836480) (- 21474836480)))) (or (let ((.cse41 (div (+ .cse43 .cse8 main_~temp~0 .cse20 .cse3 .cse21) 5))) (and (= main_~ret~1 .cse41) (<= (* (div (+ .cse8 main_~temp~0 .cse20 .cse3 10737418244 .cse21) 21474836480) 21474836480) .cse42) (<= (div (+ .cse43 .cse8 main_~temp~0 .cse20 .cse3 4 .cse21) 5) .cse41) .cse11)) (and (<= .cse42 10737418235) (<= .cse42 (+ (* 5 (div (+ (- 1) .cse8 main_~temp~0 .cse20 .cse3 .cse21) 5)) 4)) (let ((.cse44 (div .cse42 5))) (or (and (= .cse44 main_~ret~1) (<= 0 .cse42) .cse11) (and (let ((.cse45 (div (+ 5 .cse8 main_~temp~0 .cse20 .cse3 .cse21) 21474836480))) (or (and (<= (+ 10737418235 (* 21474836480 .cse45)) .cse42) (= (div (+ (- 21474836475) (* (- 21474836480) .cse45) .cse8 main_~temp~0 .cse20 .cse3 .cse21) 5) main_~ret~1)) (let ((.cse46 (+ .cse44 1))) (and (= .cse46 (+ (* 4294967296 .cse45) main_~ret~1)) (<= .cse44 (+ (* 4294967296 (div .cse46 4294967296)) 2147483646)))))) (<= (+ .cse8 main_~temp~0 .cse20 .cse3 .cse21 1) 0) .cse11)))) (let ((.cse47 (div (+ (* (- 21474836480) (div (+ .cse8 main_~temp~0 .cse20 .cse3 4 .cse21) 21474836480)) .cse8 main_~temp~0 .cse20 .cse3 (- 21474836480) .cse21) 5))) (and (= main_~ret~1 .cse47) (<= (div (+ (- 21474836476) .cse43 .cse8 main_~temp~0 .cse20 .cse3 .cse21) 5) .cse47) .cse11 (<= .cse42 (+ 21474836479 (* (div (+ .cse8 main_~temp~0 .cse20 .cse3 (- 10737418236) .cse21) 21474836480) 21474836480)))))))) (= .cse31 12) (let ((.cse48 (+ .cse1 main_~temp~0 .cse20 .cse3 .cse21))) (let ((.cse49 (div .cse48 5))) (or (and (or (= main_~ret~1 (div (+ .cse1 main_~temp~0 .cse20 .cse3 (* (- 21474836480) (div .cse48 21474836480)) .cse21) 5)) (= main_~ret~1 (div (+ (* (div (+ .cse1 main_~temp~0 .cse20 .cse3 4 .cse21) 21474836480) (- 21474836480)) .cse1 main_~temp~0 .cse20 .cse3 (- 21474836480) .cse21) 5))) (<= .cse48 (* 5 .cse49))) (and (<= .cse48 10737418235) (<= .cse48 (+ (* 5 (div (+ (- 1) .cse1 main_~temp~0 .cse20 .cse3 .cse21) 5)) 4)) (or (and (let ((.cse50 (div (+ .cse1 5 main_~temp~0 .cse20 .cse3 .cse21) 21474836480))) (or (= main_~ret~1 (div (+ .cse1 (- 21474836475) (* .cse50 (- 21474836480)) main_~temp~0 .cse20 .cse3 .cse21) 5)) (= (+ (* .cse50 4294967296) main_~ret~1) (+ .cse49 1)))) (<= (+ .cse1 main_~temp~0 .cse20 .cse3 .cse21 1) 0)) (and (= main_~ret~1 .cse49) (<= 0 .cse48))))))) .cse15)))) [2022-01-31 18:37:54,178 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) 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| 8))) (.cse3 (select .cse10 (+ |main_~#x~0.offset| 12))) (.cse4 (select .cse10 |main_~#x~0.offset|))) (let ((.cse8 (+ .cse0 .cse1 .cse2 .cse3 .cse4))) (and (let ((.cse7 (* (- 21474836480) (div .cse8 21474836480)))) (let ((.cse5 (div .cse8 5)) (.cse6 (div (+ .cse0 (- 21474836476) .cse1 .cse7 .cse2 .cse3 .cse4) 5))) (or (and (<= (* (div (+ .cse0 .cse1 5 .cse2 .cse3 .cse4) 21474836480) 21474836480) (+ .cse0 .cse1 .cse2 .cse3 4 .cse4)) (<= (+ .cse0 .cse1 .cse2 .cse3 .cse4 1) 0) (<= .cse5 (+ (* (div (+ .cse5 1) 4294967296) 4294967296) .cse6 4294967295)) (= (div (+ .cse0 (- 21474836475) .cse1 .cse7 .cse2 .cse3 .cse4) 5) main_~ret~1)) (and (<= 0 .cse8) (= main_~ret~1 .cse5)) (and (= .cse6 main_~ret~1) (<= .cse8 (+ (* (div (+ .cse0 .cse1 .cse2 .cse3 (- 10737418240) .cse4) 21474836480) 21474836480) 21474836475)))))) (<= .cse8 10737418235) (or (and (let ((.cse9 (select .cse10 12))) (<= (+ .cse9 .cse0 .cse1 .cse2 .cse4) (+ 4 (* 5 (div (+ (- 1) .cse9 .cse0 .cse1 .cse2 .cse4) 5))))) (or (<= 2147483648 |main_#t~ret8|) (<= (+ 2147483649 |main_#t~ret8|) 0))) (= main_~ret~1 |main_#t~ret8|)) (= |main_~#x~0.offset| 0) (<= 0 (+ .cse0 .cse1 10737418240 .cse2 .cse3 .cse4)))))) [2022-01-31 18:37:54,179 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse12 (* main_~i~2 4)) (.cse27 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse3 (select .cse27 (+ |main_~#x~0.offset| 8))) (.cse16 (select .cse27 (+ |main_~#x~0.offset| 12))) (.cse7 (= main_~ret~1 main_~ret2~0)) (.cse15 (select .cse27 (+ |main_~#x~0.offset| 16))) (.cse1 (select .cse27 (+ |main_~#x~0.offset| .cse12 4))) (.cse2 (select .cse27 4)) (.cse4 (select .cse27 0)) (.cse13 (= |main_~#x~0.offset| 0))) (or (and (let ((.cse5 (+ .cse1 main_~temp~0 .cse2 .cse3 .cse4))) (let ((.cse6 (* (div .cse5 21474836480) (- 21474836480)))) (or (let ((.cse0 (div (+ .cse6 .cse1 main_~temp~0 .cse2 .cse3 .cse4) 5))) (and (= main_~ret~1 .cse0) (<= (* (div (+ .cse1 main_~temp~0 .cse2 .cse3 10737418244 .cse4) 21474836480) 21474836480) .cse5) (<= (div (+ .cse6 .cse1 main_~temp~0 .cse2 .cse3 4 .cse4) 5) .cse0) .cse7)) (and (<= .cse5 10737418235) (<= .cse5 (+ (* 5 (div (+ (- 1) .cse1 main_~temp~0 .cse2 .cse3 .cse4) 5)) 4)) (let ((.cse8 (div .cse5 5))) (or (and (= .cse8 main_~ret~1) (<= 0 .cse5) .cse7) (and (let ((.cse9 (div (+ 5 .cse1 main_~temp~0 .cse2 .cse3 .cse4) 21474836480))) (or (and (<= (+ 10737418235 (* 21474836480 .cse9)) .cse5) (= (div (+ (- 21474836475) (* (- 21474836480) .cse9) .cse1 main_~temp~0 .cse2 .cse3 .cse4) 5) main_~ret~1)) (let ((.cse10 (+ .cse8 1))) (and (= .cse10 (+ (* 4294967296 .cse9) main_~ret~1)) (<= .cse8 (+ (* 4294967296 (div .cse10 4294967296)) 2147483646)))))) (<= (+ .cse1 main_~temp~0 .cse2 .cse3 .cse4 1) 0) .cse7)))) (let ((.cse11 (div (+ (* (- 21474836480) (div (+ .cse1 main_~temp~0 .cse2 .cse3 4 .cse4) 21474836480)) .cse1 main_~temp~0 .cse2 .cse3 (- 21474836480) .cse4) 5))) (and (= main_~ret~1 .cse11) (<= (div (+ (- 21474836476) .cse6 .cse1 main_~temp~0 .cse2 .cse3 .cse4) 5) .cse11) .cse7 (<= .cse5 (+ 21474836479 (* (div (+ .cse1 main_~temp~0 .cse2 .cse3 (- 10737418236) .cse4) 21474836480) 21474836480)))))))) (= .cse12 12) .cse13) (let ((.cse14 (select .cse27 (+ |main_~#x~0.offset| 4))) (.cse17 (select .cse27 |main_~#x~0.offset|))) (let ((.cse21 (+ .cse14 .cse15 .cse3 .cse16 .cse17))) (and (let ((.cse20 (* (- 21474836480) (div .cse21 21474836480)))) (let ((.cse18 (div .cse21 5)) (.cse19 (div (+ .cse14 (- 21474836476) .cse15 .cse20 .cse3 .cse16 .cse17) 5))) (or (and (<= (* (div (+ .cse14 .cse15 5 .cse3 .cse16 .cse17) 21474836480) 21474836480) (+ .cse14 .cse15 .cse3 .cse16 4 .cse17)) (<= (+ .cse14 .cse15 .cse3 .cse16 .cse17 1) 0) (<= .cse18 (+ (* (div (+ .cse18 1) 4294967296) 4294967296) .cse19 4294967295)) (= (div (+ .cse14 (- 21474836475) .cse15 .cse20 .cse3 .cse16 .cse17) 5) main_~ret~1)) (and (<= 0 .cse21) (= main_~ret~1 .cse18)) (and (= .cse19 main_~ret~1) (<= .cse21 (+ (* (div (+ .cse14 .cse15 .cse3 .cse16 (- 10737418240) .cse17) 21474836480) 21474836480) 21474836475)))))) (let ((.cse22 (select .cse27 12))) (let ((.cse24 (+ .cse22 .cse15 .cse1 main_~temp~0 .cse3))) (let ((.cse25 (div .cse24 5))) (or (and (let ((.cse23 (* (div (+ .cse22 .cse15 .cse1 main_~temp~0 .cse3 4) 21474836480) (- 21474836480)))) (or (and (= main_~ret~1 (div (+ .cse22 .cse15 .cse1 main_~temp~0 .cse3 .cse23) 5)) .cse7) (and (= main_~ret~1 (div (+ .cse22 .cse15 .cse1 main_~temp~0 .cse3 (- 21474836480) .cse23) 5)) .cse7))) (<= .cse24 (* 5 .cse25))) (and (<= .cse24 (+ (* (div (+ (- 1) .cse22 .cse15 .cse1 main_~temp~0 .cse3) 5) 5) 4)) (<= .cse24 10737418235) (or (and (<= 0 (* 4294967296 (div .cse25 4294967296))) (= main_~ret~1 .cse25) .cse7) (and (<= (+ .cse22 .cse15 .cse1 main_~temp~0 .cse3 1) 0) (let ((.cse26 (div (+ .cse22 .cse15 5 .cse1 main_~temp~0 .cse3) 21474836480))) (or (= (+ main_~ret~1 (* .cse26 4294967296)) (+ 1 .cse25)) (= (div (+ (* .cse26 (- 21474836480)) .cse22 (- 21474836475) .cse15 .cse1 main_~temp~0 .cse3) 5) main_~ret~1))) .cse7))))))) (<= .cse21 10737418235) .cse13 (<= 0 (+ .cse14 .cse15 10737418240 .cse3 .cse16 .cse17)) (= main_~i~2 0)))) (and .cse13 (= .cse12 16) (let ((.cse29 (+ main_~temp~0 .cse2 .cse3 .cse16 .cse4))) (let ((.cse30 (div .cse29 5))) (or (and (let ((.cse28 (* (div (+ main_~temp~0 .cse2 .cse3 .cse16 4 .cse4) 21474836480) (- 21474836480)))) (or (and (= (div (+ main_~temp~0 .cse2 .cse3 .cse28 (- 21474836480) .cse16 .cse4) 5) main_~ret~1) (<= .cse29 (+ 21474836479 (* (div (+ main_~temp~0 .cse2 .cse3 .cse16 (- 10737418236) .cse4) 21474836480) 21474836480))) .cse7) (and (= main_~ret~1 (div (+ main_~temp~0 .cse2 .cse3 .cse28 .cse16 .cse4) 5)) (<= (* (div (+ main_~temp~0 .cse2 .cse3 10737418244 .cse16 .cse4) 21474836480) 21474836480) .cse29) .cse7))) (<= .cse29 (* 5 .cse30))) (and (<= .cse29 (+ (* 5 (div (+ (- 1) main_~temp~0 .cse2 .cse3 .cse16 .cse4) 5)) 4)) (<= .cse29 10737418235) (or (and (<= 0 (* 4294967296 (div .cse30 4294967296))) (= main_~ret~1 .cse30) .cse7) (and (<= (+ main_~temp~0 .cse2 .cse3 .cse16 .cse4 1) 0) (let ((.cse31 (div (+ 5 main_~temp~0 .cse2 .cse3 .cse16 .cse4) 21474836480))) (or (and (= (div (+ (- 21474836475) main_~temp~0 .cse2 .cse3 (* (- 21474836480) .cse31) .cse16 .cse4) 5) main_~ret~1) (<= (+ (* .cse31 21474836480) 10737418235) .cse29)) (let ((.cse32 (+ .cse30 1))) (and (<= .cse30 (+ (* (div .cse32 4294967296) 4294967296) 2147483646)) (= .cse32 (+ (* 4294967296 .cse31) main_~ret~1)))))) .cse7))))))) (and (let ((.cse34 (select .cse27 (+ .cse12 8)))) (let ((.cse35 (+ .cse15 .cse1 main_~temp~0 .cse34 .cse4))) (let ((.cse36 (div .cse35 5))) (or (and (let ((.cse33 (* (div .cse35 21474836480) (- 21474836480)))) (or (and (= main_~ret~1 (div (+ .cse33 .cse15 .cse1 main_~temp~0 .cse34 .cse4) 5)) (<= (* (div (+ .cse15 .cse1 main_~temp~0 10737418244 .cse34 .cse4) 21474836480) 21474836480) .cse35) .cse7) (and (<= .cse35 (+ 21474836479 (* (div (+ .cse15 .cse1 main_~temp~0 .cse34 (- 10737418240) .cse4) 21474836480) 21474836480))) (= (div (+ .cse33 .cse15 .cse1 main_~temp~0 (- 21474836480) .cse34 .cse4) 5) main_~ret~1) .cse7))) (<= .cse35 (* 5 .cse36))) (and (<= .cse35 (+ (* 5 (div (+ (- 1) .cse15 .cse1 main_~temp~0 .cse34 .cse4) 5)) 4)) (or (and (<= (+ .cse15 .cse1 main_~temp~0 .cse34 .cse4 1) 0) (let ((.cse37 (div (+ .cse15 5 .cse1 main_~temp~0 .cse34 .cse4) 21474836480))) (or (and (<= (+ (* 21474836480 .cse37) 10737418235) .cse35) (= main_~ret~1 (div (+ (- 21474836475) .cse15 .cse1 main_~temp~0 .cse34 (* (- 21474836480) .cse37) .cse4) 5))) (let ((.cse38 (+ .cse36 1))) (and (= .cse38 (+ main_~ret~1 (* 4294967296 .cse37))) (<= .cse36 (+ (* (div .cse38 4294967296) 4294967296) 2147483646)))))) .cse7) (and (= main_~ret~1 .cse36) (<= 0 (* 4294967296 (div .cse36 4294967296))) .cse7)) (<= .cse35 10737418235)))))) .cse13 (= .cse12 4)) (and (let ((.cse39 (+ .cse15 .cse1 main_~temp~0 .cse2 .cse4))) (let ((.cse41 (div .cse39 5))) (or (and (let ((.cse40 (* (div .cse39 21474836480) (- 21474836480)))) (or (and (<= .cse39 (+ 21474836479 (* (div (+ .cse15 .cse1 main_~temp~0 .cse2 (- 10737418240) .cse4) 21474836480) 21474836480))) (= main_~ret~1 (div (+ .cse40 .cse15 .cse1 main_~temp~0 .cse2 (- 21474836480) .cse4) 5)) .cse7) (and (= main_~ret~1 (div (+ .cse40 .cse15 .cse1 main_~temp~0 .cse2 .cse4) 5)) (<= (* (div (+ .cse15 .cse1 main_~temp~0 .cse2 10737418244 .cse4) 21474836480) 21474836480) .cse39) .cse7))) (<= .cse39 (* .cse41 5))) (and (<= .cse39 10737418235) (or (and (let ((.cse43 (div (+ .cse15 5 .cse1 main_~temp~0 .cse2 .cse4) 21474836480))) (or (let ((.cse42 (+ .cse41 1))) (and (<= .cse41 (+ (* (div .cse42 4294967296) 4294967296) 2147483646)) (= (+ (* 4294967296 .cse43) main_~ret~1) .cse42))) (and (<= (+ (* 21474836480 .cse43) 10737418235) .cse39) (= main_~ret~1 (div (+ (- 21474836475) .cse15 .cse1 main_~temp~0 .cse2 (* (- 21474836480) .cse43) .cse4) 5))))) (<= (+ .cse15 .cse1 main_~temp~0 .cse2 .cse4 1) 0) .cse7) (and (<= 0 .cse39) (= .cse41 main_~ret~1) .cse7)) (<= .cse39 (+ (* (div (+ (- 1) .cse15 .cse1 main_~temp~0 .cse2 .cse4) 5) 5) 4)))))) (= .cse12 8) .cse13)))) [2022-01-31 18:37:54,179 INFO L854 garLoopResultBuilder]: At program point L43-4(lines 43 45) the Hoare annotation is: (and (= |main_~#x~0.offset| 0) (= (* main_~i~2 4) 16) (let ((.cse10 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse10 4)) (.cse1 (select .cse10 (+ |main_~#x~0.offset| 8))) (.cse3 (select .cse10 (+ |main_~#x~0.offset| 12))) (.cse4 (select .cse10 0))) (let ((.cse5 (+ main_~temp~0 .cse0 .cse1 .cse3 .cse4))) (let ((.cse7 (div .cse5 5)) (.cse6 (= main_~ret~1 main_~ret2~0))) (or (and (let ((.cse2 (* (div (+ main_~temp~0 .cse0 .cse1 .cse3 4 .cse4) 21474836480) (- 21474836480)))) (or (and (= (div (+ main_~temp~0 .cse0 .cse1 .cse2 (- 21474836480) .cse3 .cse4) 5) main_~ret~1) (<= .cse5 (+ 21474836479 (* (div (+ main_~temp~0 .cse0 .cse1 .cse3 (- 10737418236) .cse4) 21474836480) 21474836480))) .cse6) (and (= main_~ret~1 (div (+ main_~temp~0 .cse0 .cse1 .cse2 .cse3 .cse4) 5)) (<= (* (div (+ main_~temp~0 .cse0 .cse1 10737418244 .cse3 .cse4) 21474836480) 21474836480) .cse5) .cse6))) (<= .cse5 (* 5 .cse7))) (and (<= .cse5 (+ (* 5 (div (+ (- 1) main_~temp~0 .cse0 .cse1 .cse3 .cse4) 5)) 4)) (<= .cse5 10737418235) (or (and (<= 0 (* 4294967296 (div .cse7 4294967296))) (= main_~ret~1 .cse7) .cse6) (and (<= (+ main_~temp~0 .cse0 .cse1 .cse3 .cse4 1) 0) (let ((.cse8 (div (+ 5 main_~temp~0 .cse0 .cse1 .cse3 .cse4) 21474836480))) (or (and (= (div (+ (- 21474836475) main_~temp~0 .cse0 .cse1 (* (- 21474836480) .cse8) .cse3 .cse4) 5) main_~ret~1) (<= (+ (* .cse8 21474836480) 10737418235) .cse5)) (let ((.cse9 (+ .cse7 1))) (and (<= .cse7 (+ (* (div .cse9 4294967296) 4294967296) 2147483646)) (= .cse9 (+ (* 4294967296 .cse8) main_~ret~1)))))) .cse6))))))))) [2022-01-31 18:37:54,179 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 18:37:54,179 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:37:54,179 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 18:37:54,179 INFO L854 garLoopResultBuilder]: At program point avgEXIT(lines 15 24) the Hoare annotation is: (let ((.cse21 (select |#memory_int| |avg_#in~x.base|))) (let ((.cse2 (select .cse21 (+ |avg_#in~x.offset| 4))) (.cse9 (select .cse21 (+ 16 |avg_#in~x.offset|))) (.cse0 (select .cse21 (+ 12 |avg_#in~x.offset|))) (.cse3 (select .cse21 (+ 8 |avg_#in~x.offset|))) (.cse1 (select .cse21 |avg_#in~x.offset|))) (let ((.cse14 (* 5 |avg_#res|)) (.cse4 (* (- 1) .cse1)) (.cse5 (* (- 1) .cse3)) (.cse6 (* (- 1) .cse0)) (.cse7 (* (- 1) .cse9)) (.cse8 (* (- 1) .cse2))) (let ((.cse18 (<= 1 |avg_#in~x.offset|)) (.cse20 (<= (+ |avg_#in~x.offset| 1) 0)) (.cse11 (<= (+ .cse0 10737418241 .cse1 .cse2 .cse3 .cse9) 0)) (.cse13 (<= 0 (+ .cse0 .cse1 5 .cse2 .cse3 (* 21474836480 (div (+ .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 4) 21474836480)) .cse9))) (.cse26 (+ .cse0 .cse1 .cse2 .cse3 .cse9 1)) (.cse12 (<= 0 (+ 2147483648 |avg_#res|))) (.cse15 (+ .cse0 .cse1 .cse2 .cse3 .cse9))) (and (or (<= (+ .cse0 .cse1 .cse2 .cse3 (* (div (+ .cse4 .cse5 5 .cse6 .cse7 .cse8) 5) 5) .cse9) 4) (let ((.cse10 (<= (+ .cse0 .cse1 .cse2 .cse3 .cse9 (* (div (+ .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 42949672959) 21474836480) 21474836480)) 21474836479))) (and (or .cse10 (<= 0 (+ .cse0 .cse1 .cse2 .cse3 .cse9 4)) .cse11) (or (and .cse10 .cse12) .cse13)))) (<= 5 avg_~i~0) (<= .cse15 avg_~ret~0) (<= avg_~ret~0 .cse15) (let ((.cse17 (select .cse21 12))) (let ((.cse19 (* (- 1) .cse17))) (let ((.cse16 (div (+ .cse19 .cse4 .cse5 .cse7 .cse8 4) 5))) (or (<= 0 (+ .cse1 .cse2 .cse3 (* (div (+ .cse16 2147483646) 4294967296) 21474836480) .cse9 4 .cse17)) .cse18 (<= 0 (+ .cse1 .cse2 .cse3 (* 5 (div (+ .cse19 .cse4 .cse5 .cse7 .cse8) 5)) .cse9 .cse17)) .cse20 (= (+ .cse16 4294967295 |avg_#res|) (* (div (+ 21474836479 .cse19 .cse4 .cse5 .cse7 .cse8) 21474836480) 4294967296)) (<= 0 (+ .cse1 .cse2 .cse3 .cse9 .cse17)))))) (let ((.cse22 (select .cse21 0)) (.cse23 (select .cse21 4))) (let ((.cse24 (+ .cse0 .cse22 .cse3 .cse9 .cse23))) (let ((.cse25 (<= .cse24 (+ (* 5 (div (+ (- 1) .cse0 .cse22 .cse3 .cse9 .cse23) 5)) 4)))) (or .cse18 .cse20 (and (<= (+ .cse0 .cse22 .cse3 .cse9 .cse23 1) 0) (or (<= .cse24 (+ 21474836474 (* (div (+ .cse0 .cse22 (- 10737418235) .cse3 .cse9 .cse23) 21474836480) 21474836480))) (= (div (+ .cse0 5 .cse22 .cse3 (* (div (+ .cse0 5 .cse22 .cse3 .cse9 .cse23) 21474836480) (- 21474836480)) .cse9 .cse23) 5) |avg_#res|)) .cse25) (and (or .cse25 (= (div (+ .cse0 (* (div (+ .cse0 .cse22 .cse3 10737418244 .cse9 .cse23) 21474836480) (- 21474836480)) .cse22 .cse3 .cse9 .cse23) 5) |avg_#res|)) (or (<= .cse24 (* 5 (div .cse24 5))) (<= 42949672960 (+ (* .cse9 4) (* .cse22 4) (* .cse0 4) (* .cse3 4) (* .cse23 4))) (= (div (+ .cse0 (* (- 1) (div (+ .cse0 .cse22 .cse3 .cse9 .cse23 4) 5)) .cse22 .cse3 .cse9 .cse23) 4) |avg_#res|))))))) (or (and (or (<= .cse14 (+ .cse0 .cse1 5 .cse2 .cse3 .cse9)) .cse11) (or (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse9 (* (div (+ 21474836479 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8) 21474836480) 21474836480)) 21474836479) .cse13) (<= .cse26 0))) (<= (+ (* 21474836480 (div (+ 42949672954 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8) 21474836480)) .cse0 .cse1 .cse2 .cse3 .cse9) 21474836479)) (or (<= .cse26 .cse14) (and .cse12 (or (<= .cse15 .cse14) (<= 0 .cse15))))))))) [2022-01-31 18:37:54,180 INFO L854 garLoopResultBuilder]: At program point L20-2(lines 20 22) the Hoare annotation is: (let ((.cse0 (* 4 avg_~i~0)) (.cse7 (select |#memory_int| avg_~x.base))) (let ((.cse2 (= |avg_#in~x.base| avg_~x.base)) (.cse3 (= |avg_#in~x.offset| avg_~x.offset)) (.cse5 (select .cse7 |avg_#in~x.offset|)) (.cse1 (select .cse7 (+ .cse0 avg_~x.offset))) (.cse6 (select .cse7 (+ 4 avg_~x.offset)))) (or (and (= .cse0 0) (<= avg_~ret~0 .cse1) .cse2 (<= .cse1 avg_~ret~0) .cse3) (let ((.cse4 (+ .cse5 .cse1 .cse6 (select .cse7 (+ 8 avg_~x.offset))))) (and (<= avg_~i~0 3) (<= avg_~ret~0 .cse4) (<= .cse4 avg_~ret~0) .cse2 (<= 3 avg_~i~0) .cse3)) (let ((.cse8 (let ((.cse9 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse9 (+ 12 |avg_#in~x.offset|)) (select .cse9 |avg_#in~x.offset|) (select .cse9 (+ |avg_#in~x.offset| 4)) (select .cse9 (+ 8 |avg_#in~x.offset|)) (select .cse9 (+ 16 |avg_#in~x.offset|)))))) (and (<= .cse8 avg_~ret~0) (<= avg_~ret~0 .cse8) (<= 4 avg_~i~0) (<= avg_~i~0 4))) (let ((.cse10 (+ .cse5 .cse1))) (and .cse2 (<= 1 avg_~i~0) (<= avg_~i~0 1) (<= avg_~ret~0 .cse10) (<= .cse10 avg_~ret~0) .cse3)) (let ((.cse11 (+ .cse5 .cse1 .cse6))) (and (<= avg_~ret~0 .cse11) (<= .cse11 avg_~ret~0) (<= 2 avg_~i~0) .cse2 (<= avg_~i~0 2) .cse3))))) [2022-01-31 18:37:54,180 INFO L854 garLoopResultBuilder]: At program point avgFINAL(lines 15 24) the Hoare annotation is: (let ((.cse21 (select |#memory_int| |avg_#in~x.base|))) (let ((.cse2 (select .cse21 (+ |avg_#in~x.offset| 4))) (.cse9 (select .cse21 (+ 16 |avg_#in~x.offset|))) (.cse0 (select .cse21 (+ 12 |avg_#in~x.offset|))) (.cse3 (select .cse21 (+ 8 |avg_#in~x.offset|))) (.cse1 (select .cse21 |avg_#in~x.offset|))) (let ((.cse14 (* 5 |avg_#res|)) (.cse4 (* (- 1) .cse1)) (.cse5 (* (- 1) .cse3)) (.cse6 (* (- 1) .cse0)) (.cse7 (* (- 1) .cse9)) (.cse8 (* (- 1) .cse2))) (let ((.cse18 (<= 1 |avg_#in~x.offset|)) (.cse20 (<= (+ |avg_#in~x.offset| 1) 0)) (.cse11 (<= (+ .cse0 10737418241 .cse1 .cse2 .cse3 .cse9) 0)) (.cse13 (<= 0 (+ .cse0 .cse1 5 .cse2 .cse3 (* 21474836480 (div (+ .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 4) 21474836480)) .cse9))) (.cse26 (+ .cse0 .cse1 .cse2 .cse3 .cse9 1)) (.cse12 (<= 0 (+ 2147483648 |avg_#res|))) (.cse15 (+ .cse0 .cse1 .cse2 .cse3 .cse9))) (and (or (<= (+ .cse0 .cse1 .cse2 .cse3 (* (div (+ .cse4 .cse5 5 .cse6 .cse7 .cse8) 5) 5) .cse9) 4) (let ((.cse10 (<= (+ .cse0 .cse1 .cse2 .cse3 .cse9 (* (div (+ .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 42949672959) 21474836480) 21474836480)) 21474836479))) (and (or .cse10 (<= 0 (+ .cse0 .cse1 .cse2 .cse3 .cse9 4)) .cse11) (or (and .cse10 .cse12) .cse13)))) (<= 5 avg_~i~0) (<= .cse15 avg_~ret~0) (<= avg_~ret~0 .cse15) (let ((.cse17 (select .cse21 12))) (let ((.cse19 (* (- 1) .cse17))) (let ((.cse16 (div (+ .cse19 .cse4 .cse5 .cse7 .cse8 4) 5))) (or (<= 0 (+ .cse1 .cse2 .cse3 (* (div (+ .cse16 2147483646) 4294967296) 21474836480) .cse9 4 .cse17)) .cse18 (<= 0 (+ .cse1 .cse2 .cse3 (* 5 (div (+ .cse19 .cse4 .cse5 .cse7 .cse8) 5)) .cse9 .cse17)) .cse20 (= (+ .cse16 4294967295 |avg_#res|) (* (div (+ 21474836479 .cse19 .cse4 .cse5 .cse7 .cse8) 21474836480) 4294967296)) (<= 0 (+ .cse1 .cse2 .cse3 .cse9 .cse17)))))) (let ((.cse22 (select .cse21 0)) (.cse23 (select .cse21 4))) (let ((.cse24 (+ .cse0 .cse22 .cse3 .cse9 .cse23))) (let ((.cse25 (<= .cse24 (+ (* 5 (div (+ (- 1) .cse0 .cse22 .cse3 .cse9 .cse23) 5)) 4)))) (or .cse18 .cse20 (and (<= (+ .cse0 .cse22 .cse3 .cse9 .cse23 1) 0) (or (<= .cse24 (+ 21474836474 (* (div (+ .cse0 .cse22 (- 10737418235) .cse3 .cse9 .cse23) 21474836480) 21474836480))) (= (div (+ .cse0 5 .cse22 .cse3 (* (div (+ .cse0 5 .cse22 .cse3 .cse9 .cse23) 21474836480) (- 21474836480)) .cse9 .cse23) 5) |avg_#res|)) .cse25) (and (or .cse25 (= (div (+ .cse0 (* (div (+ .cse0 .cse22 .cse3 10737418244 .cse9 .cse23) 21474836480) (- 21474836480)) .cse22 .cse3 .cse9 .cse23) 5) |avg_#res|)) (or (<= .cse24 (* 5 (div .cse24 5))) (<= 42949672960 (+ (* .cse9 4) (* .cse22 4) (* .cse0 4) (* .cse3 4) (* .cse23 4))) (= (div (+ .cse0 (* (- 1) (div (+ .cse0 .cse22 .cse3 .cse9 .cse23 4) 5)) .cse22 .cse3 .cse9 .cse23) 4) |avg_#res|))))))) (or (and (or (<= .cse14 (+ .cse0 .cse1 5 .cse2 .cse3 .cse9)) .cse11) (or (and (<= (+ .cse0 .cse1 .cse2 .cse3 .cse9 (* (div (+ 21474836479 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8) 21474836480) 21474836480)) 21474836479) .cse13) (<= .cse26 0))) (<= (+ (* 21474836480 (div (+ 42949672954 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8) 21474836480)) .cse0 .cse1 .cse2 .cse3 .cse9) 21474836479)) (or (<= .cse26 .cse14) (and .cse12 (or (<= .cse15 .cse14) (<= 0 .cse15))))))))) [2022-01-31 18:37:54,180 INFO L854 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse9 (select |#memory_int| avg_~x.base))) (let ((.cse7 (select .cse9 (+ 8 avg_~x.offset))) (.cse2 (select .cse9 |avg_#in~x.offset|)) (.cse6 (select .cse9 (+ 4 avg_~x.offset))) (.cse3 (= |avg_#in~x.base| avg_~x.base)) (.cse4 (= |avg_#in~x.offset| avg_~x.offset))) (or (let ((.cse0 (let ((.cse1 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse1 (+ 12 |avg_#in~x.offset|)) (select .cse1 |avg_#in~x.offset|) (select .cse1 (+ |avg_#in~x.offset| 4)) (select .cse1 (+ 8 |avg_#in~x.offset|)) (select .cse1 (+ 16 |avg_#in~x.offset|)))))) (and (<= 5 avg_~i~0) (<= .cse0 avg_~ret~0) (<= avg_~ret~0 .cse0))) (and (<= .cse2 avg_~ret~0) .cse3 (<= 1 avg_~i~0) (<= avg_~i~0 1) (<= avg_~ret~0 .cse2) .cse4) (let ((.cse5 (+ .cse2 .cse6 .cse7))) (and (<= avg_~i~0 3) (<= avg_~ret~0 .cse5) .cse3 (<= .cse5 avg_~ret~0) (<= 3 avg_~i~0) .cse4)) (let ((.cse8 (+ .cse2 .cse6 (select .cse9 (+ 12 avg_~x.offset)) .cse7))) (and (<= avg_~ret~0 .cse8) .cse3 (<= .cse8 avg_~ret~0) (<= 4 avg_~i~0) (<= avg_~i~0 4) .cse4)) (let ((.cse10 (+ .cse2 .cse6))) (and (<= .cse10 avg_~ret~0) (<= 2 avg_~i~0) .cse3 (<= avg_~ret~0 .cse10) (<= avg_~i~0 2) .cse4)) (and (<= avg_~ret~0 0) (= (* 4 avg_~i~0) 0) (<= 0 avg_~ret~0) .cse3 .cse4)))) [2022-01-31 18:37:54,180 INFO L854 garLoopResultBuilder]: At program point L20-4(lines 20 22) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (select |#memory_int| |avg_#in~x.base|))) (+ (select .cse1 (+ 12 |avg_#in~x.offset|)) (select .cse1 |avg_#in~x.offset|) (select .cse1 (+ |avg_#in~x.offset| 4)) (select .cse1 (+ 8 |avg_#in~x.offset|)) (select .cse1 (+ 16 |avg_#in~x.offset|)))))) (and (<= 5 avg_~i~0) (<= .cse0 avg_~ret~0) (<= avg_~ret~0 .cse0))) [2022-01-31 18:37:54,180 INFO L861 garLoopResultBuilder]: At program point avgENTRY(lines 15 24) the Hoare annotation is: true [2022-01-31 18:37:54,180 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 18:37:54,180 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 18:37:54,180 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 18:37:54,180 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 18:37:54,182 INFO L732 BasicCegarLoop]: Path program histogram: [12, 3, 1, 1] [2022-01-31 18:37:54,183 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 18:37:54,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 06:37:54 BoogieIcfgContainer [2022-01-31 18:37:54,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 18:37:54,225 INFO L158 Benchmark]: Toolchain (without parser) took 679184.18ms. Allocated memory was 212.9MB in the beginning and 792.7MB in the end (delta: 579.9MB). Free memory was 164.2MB in the beginning and 493.9MB in the end (delta: -329.8MB). Peak memory consumption was 457.5MB. Max. memory is 8.0GB. [2022-01-31 18:37:54,225 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory was 180.4MB in the beginning and 180.4MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 18:37:54,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.74ms. Allocated memory is still 212.9MB. Free memory was 164.0MB in the beginning and 189.6MB in the end (delta: -25.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 18:37:54,225 INFO L158 Benchmark]: Boogie Preprocessor took 39.66ms. Allocated memory is still 212.9MB. Free memory was 189.6MB in the beginning and 188.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 18:37:54,226 INFO L158 Benchmark]: RCFGBuilder took 273.12ms. Allocated memory is still 212.9MB. Free memory was 188.0MB in the beginning and 176.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 18:37:54,226 INFO L158 Benchmark]: TraceAbstraction took 678633.69ms. Allocated memory was 212.9MB in the beginning and 792.7MB in the end (delta: 579.9MB). Free memory was 175.4MB in the beginning and 493.9MB in the end (delta: -318.5MB). Peak memory consumption was 468.4MB. Max. memory is 8.0GB. [2022-01-31 18:37:54,227 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.12ms. Allocated memory is still 212.9MB. Free memory was 180.4MB in the beginning and 180.4MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.74ms. Allocated memory is still 212.9MB. Free memory was 164.0MB in the beginning and 189.6MB in the end (delta: -25.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.66ms. Allocated memory is still 212.9MB. Free memory was 189.6MB in the beginning and 188.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 273.12ms. Allocated memory is still 212.9MB. Free memory was 188.0MB in the beginning and 176.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 678633.69ms. Allocated memory was 212.9MB in the beginning and 792.7MB in the end (delta: 579.9MB). Free memory was 175.4MB in the beginning and 493.9MB in the end (delta: -318.5MB). Peak memory consumption was 468.4MB. 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: 678.6s, OverallIterations: 17, TraceHistogramMax: 16, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 298.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 139.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 764 SdHoareTripleChecker+Invalid, 15.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3104 IncrementalHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 402 mSDtfsCounter, 3104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 160 SyntacticMatches, 10 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 322.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=15, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 18 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 259 PreInvPairs, 337 NumberOfFragments, 20388 HoareAnnotationTreeSize, 259 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 31 FomulaSimplificationsInter, 7999 FormulaSimplificationTreeSizeReductionInter, 139.6s 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 <= 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][x] <= 8589934588) && 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][x]) && i <= 4) || (((5 <= i && 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][x] <= 10737418235) && x == 0) && 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][x])) || ((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= 4294967294 && i <= 2) && x == 0) && 2 <= i) && 0 <= unknown-#memory_int-unknown[x][x + 4] + 4294967296 + unknown-#memory_int-unknown[x][x])) || (x == 0 && i == 0)) || ((((0 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] + 6442450944 && i <= 3) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x] <= 6442450941) && x == 0) && 3 <= i)) || ((((0 <= unknown-#memory_int-unknown[x][x] + 2147483648 && 1 <= i) && unknown-#memory_int-unknown[x][x] <= 2147483647) && i <= 1) && x == 0) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((((ret == ((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5 && (unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + 10737418244 + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480 <= unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) && ((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + 4 + unknown-#memory_int-unknown[x][0]) / 5 <= ((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5) && ret == ret2) || ((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] <= 10737418235 && unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] <= 5 * ((-1 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5) + 4) && ((((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5 == ret && 0 <= unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) && ret == ret2) || ((((10737418235 + 21474836480 * ((5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480) <= unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] && (-21474836475 + -21474836480 * ((5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480) + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5 == ret) || ((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5 + 1 == 4294967296 * ((5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480) + ret && (unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5 <= 4294967296 * (((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5 + 1) / 4294967296) + 2147483646)) && unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0) && ret == ret2)))) || (((ret == (-21474836480 * ((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + 4 + unknown-#memory_int-unknown[x][0]) / 21474836480) + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][0]) / 5 && (-21474836476 + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0]) / 5 <= (-21474836480 * ((unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + 4 + unknown-#memory_int-unknown[x][0]) / 21474836480) + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + unknown-#memory_int-unknown[x][0]) / 5) && ret == ret2) && unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][0] <= 21474836479 + (unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + -10737418236 + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480)) && i * 4 == 12) && x == 0) || (((((((((((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x]) / 21474836480 * 21474836480 <= 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] + 4 + unknown-#memory_int-unknown[x][x] && 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][x] + 1 <= 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][x]) / 5 <= ((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][x]) / 5 + 1) / 4294967296 * 4294967296 + (unknown-#memory_int-unknown[x][x + 4] + -21474836476 + unknown-#memory_int-unknown[x][x + 16] + -21474836480 * ((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][x]) / 21474836480) + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x]) / 5 + 4294967295) && (unknown-#memory_int-unknown[x][x + 4] + -21474836475 + unknown-#memory_int-unknown[x][x + 16] + -21474836480 * ((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][x]) / 21474836480) + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x]) / 5 == ret) || (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][x] && ret == (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][x]) / 5)) || ((unknown-#memory_int-unknown[x][x + 4] + -21474836476 + unknown-#memory_int-unknown[x][x + 16] + -21474836480 * ((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][x]) / 21474836480) + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x]) / 5 == ret && 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][x] <= (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] + -10737418240 + unknown-#memory_int-unknown[x][x]) / 21474836480 * 21474836480 + 21474836475)) && ((((ret == (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + 4) / 21474836480 * -21474836480) / 5 && ret == ret2) || (ret == (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + -21474836480 + (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + 4) / 21474836480 * -21474836480) / 5 && ret == ret2)) && unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] <= 5 * ((unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) / 5)) || ((unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] <= (-1 + unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) / 5 * 5 + 4 && unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] <= 10737418235) && (((0 <= 4294967296 * ((unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) / 5 / 4294967296) && ret == (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) / 5) && ret == ret2) || ((unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + 1 <= 0 && (ret + (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) / 21474836480 * 4294967296 == 1 + (unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) / 5 || ((unknown-#memory_int-unknown[x][12] + unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][12] + -21474836475 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][x + 8]) / 5 == ret)) && ret == ret2))))) && 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][x] <= 10737418235) && x == 0) && 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][x]) && i == 0)) || ((x == 0 && i * 4 == 16) && ((((((temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + (temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + 4 + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5 == ret && temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] <= 21474836479 + (temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + -10737418236 + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480) && ret == ret2) || ((ret == (temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + (temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + 4 + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5 && (temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + 10737418244 + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480 <= temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) && ret == ret2)) && temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] <= 5 * ((temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5)) || ((temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] <= 5 * ((-1 + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5) + 4 && temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] <= 10737418235) && (((0 <= 4294967296 * ((temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5 / 4294967296) && ret == (temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5) && ret == ret2) || ((temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && (((-21474836475 + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + -21474836480 * ((5 + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 21474836480) + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5 == ret && (5 + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480 + 10737418235 <= temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) || ((temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5 <= ((temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5 + 1) / 4294967296 * 4294967296 + 2147483646 && (temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 5 + 1 == 4294967296 * ((5 + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][0]) / 21474836480) + ret))) && ret == ret2)))))) || (((((((ret == ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5 && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + 10737418244 + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480 <= unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) && ret == ret2) || ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 21474836479 + (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + -10737418240 + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480 && ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + -21474836480 + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5 == ret) && ret == ret2)) && unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 5 * ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5)) || ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 5 * ((-1 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5) + 4 && (((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] + 1 <= 0 && ((21474836480 * ((unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480) + 10737418235 <= unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] && ret == (-21474836475 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + -21474836480 * ((unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480) + unknown-#memory_int-unknown[x][0]) / 5) || ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5 + 1 == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 21474836480) && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5 <= ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5 + 1) / 4294967296 * 4294967296 + 2147483646))) && ret == ret2) || ((ret == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5 && 0 <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0]) / 5 / 4294967296)) && ret == ret2))) && unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][i * 4 + 8] + unknown-#memory_int-unknown[x][0] <= 10737418235)) && x == 0) && i * 4 == 4)) || (((((((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0] <= 21474836479 + (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + -10737418240 + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480 && ret == ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + -21474836480 + unknown-#memory_int-unknown[x][0]) / 5) && ret == ret2) || ((ret == ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 5 && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + 10737418244 + unknown-#memory_int-unknown[x][0]) / 21474836480 * 21474836480 <= unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) && ret == ret2)) && unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0] <= (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 5 * 5) || ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0] <= 10737418235 && ((((((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 5 <= ((unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 5 + 1) / 4294967296 * 4294967296 + 2147483646 && 4294967296 * ((unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 21474836480) + ret == (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 5 + 1) || (21474836480 * ((unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 21474836480) + 10737418235 <= unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0] && ret == (-21474836475 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + -21474836480 * ((unknown-#memory_int-unknown[x][x + 16] + 5 + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 21474836480) + unknown-#memory_int-unknown[x][0]) / 5)) && unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0] + 1 <= 0) && ret == ret2) || ((0 <= unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0] && (unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 5 == ret) && ret == ret2))) && unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0] <= (-1 + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + i * 4 + 4] + temp + unknown-#memory_int-unknown[x][4] + unknown-#memory_int-unknown[x][0]) / 5 * 5 + 4)) && i * 4 == 8) && x == 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((5 <= i && unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] <= ret) && ret <= unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x]) || (((((unknown-#memory_int-unknown[x][x] <= ret && x == x) && 1 <= i) && i <= 1) && ret <= unknown-#memory_int-unknown[x][x]) && x == x)) || (((((i <= 3 && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][8 + x]) && x == x) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][8 + x] <= ret) && 3 <= i) && x == x)) || (((((ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] && x == x) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][8 + x] <= ret) && 4 <= i) && i <= 4) && x == x)) || (((((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x] <= ret && 2 <= i) && x == x) && ret <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][4 + x]) && i <= 2) && x == x)) || ((((ret <= 0 && 4 * i == 0) && 0 <= ret) && x == x) && x == x) - ProcedureContractResult [Line: 15]: Procedure Contract for avg Derived contract for procedure avg: (((((((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + (-1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + 5 + -1 * unknown-#memory_int-unknown[x][12 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4]) / 5 * 5 + unknown-#memory_int-unknown[x][16 + x] <= 4 || (((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + (5 * \result + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][12 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4] + 42949672959) / 21474836480 * 21474836480 <= 21474836479 || 0 <= unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + 4) || unknown-#memory_int-unknown[x][12 + x] + 10737418241 + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] <= 0) && ((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + (5 * \result + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][12 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4] + 42949672959) / 21474836480 * 21474836480 <= 21474836479 && 0 <= 2147483648 + \result) || 0 <= unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + 5 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + 21474836480 * ((5 * \result + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][12 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4] + 4) / 21474836480) + unknown-#memory_int-unknown[x][16 + x]))) && 5 <= i) && unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] <= ret) && ret <= unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x]) && (((((0 <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + ((-1 * unknown-#memory_int-unknown[x][12] + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4] + 4) / 5 + 2147483646) / 4294967296 * 21474836480 + unknown-#memory_int-unknown[x][16 + x] + 4 + unknown-#memory_int-unknown[x][12] || 1 <= x) || 0 <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + 5 * ((-1 * unknown-#memory_int-unknown[x][12] + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4]) / 5) + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12]) || x + 1 <= 0) || (-1 * unknown-#memory_int-unknown[x][12] + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4] + 4) / 5 + 4294967295 + \result == (21474836479 + -1 * unknown-#memory_int-unknown[x][12] + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4]) / 21474836480 * 4294967296) || 0 <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12])) && (((1 <= x || x + 1 <= 0) || ((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4] + 1 <= 0 && (unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4] <= 21474836474 + (unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + -10737418235 + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 21474836480 * 21474836480 || (unknown-#memory_int-unknown[x][12 + x] + 5 + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + (unknown-#memory_int-unknown[x][12 + x] + 5 + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 5 == \result)) && unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4] <= 5 * ((-1 + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 5) + 4)) || ((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4] <= 5 * ((-1 + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 5) + 4 || (unknown-#memory_int-unknown[x][12 + x] + (unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + 10737418244 + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 21474836480 * -21474836480 + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 5 == \result) && ((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4] <= 5 * ((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 5) || 42949672960 <= unknown-#memory_int-unknown[x][16 + x] * 4 + unknown-#memory_int-unknown[x][0] * 4 + unknown-#memory_int-unknown[x][12 + x] * 4 + unknown-#memory_int-unknown[x][8 + x] * 4 + unknown-#memory_int-unknown[x][4] * 4) || (unknown-#memory_int-unknown[x][12 + x] + -1 * ((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4] + 4) / 5) + unknown-#memory_int-unknown[x][0] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][4]) / 4 == \result)))) && (((5 * \result <= unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + 5 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] || unknown-#memory_int-unknown[x][12 + x] + 10737418241 + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] <= 0) && ((unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + (21474836479 + 5 * \result + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][12 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4]) / 21474836480 * 21474836480 <= 21474836479 && 0 <= unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + 5 + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + 21474836480 * ((5 * \result + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][12 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4] + 4) / 21474836480) + unknown-#memory_int-unknown[x][16 + x]) || unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + 1 <= 0)) || 21474836480 * ((42949672954 + 5 * \result + -1 * unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[x][8 + x] + -1 * unknown-#memory_int-unknown[x][12 + x] + -1 * unknown-#memory_int-unknown[x][16 + x] + -1 * unknown-#memory_int-unknown[x][x + 4]) / 21474836480) + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] <= 21474836479)) && (unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] + 1 <= 5 * \result || (0 <= 2147483648 + \result && (unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x] <= 5 * \result || 0 <= unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][16 + x]))) - 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:37:54,260 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...