./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 20:59:02,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:59:02,273 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-21 20:59:02,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:59:02,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:59:02,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:59:02,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:59:02,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:59:02,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 20:59:02,311 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 20:59:02,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:59:02,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:59:02,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:59:02,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:59:02,315 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:59:02,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:59:02,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 20:59:02,333 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:59:02,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:59:02,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:59:02,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:59:02,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 20:59:02,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:59:02,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 20:59:02,338 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-21 20:59:02,338 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 20:59:02,339 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:59:02,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:59:02,340 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:59:02,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:59:02,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:59:02,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 20:59:02,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:59:02,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:59:02,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:59:02,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:59:02,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 20:59:02,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:59:02,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:59:02,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:59:02,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 20:59:02,346 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 20:59:02,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 20:59:02,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 20:59:02,347 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2023-11-21 20:59:02,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:59:02,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:59:02,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:59:02,693 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:59:02,694 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:59:02,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-21 20:59:05,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:59:06,024 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:59:06,025 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-21 20:59:06,035 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/data/677f4cf07/b1216428dc7e436695448ea85dd997ca/FLAGfe63f4cda [2023-11-21 20:59:06,054 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/data/677f4cf07/b1216428dc7e436695448ea85dd997ca [2023-11-21 20:59:06,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:59:06,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:59:06,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:59:06,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:59:06,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:59:06,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33093dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06, skipping insertion in model container [2023-11-21 20:59:06,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,105 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:59:06,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:59:06,343 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:59:06,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:59:06,398 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:59:06,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06 WrapperNode [2023-11-21 20:59:06,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:59:06,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:59:06,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:59:06,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:59:06,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,445 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2023-11-21 20:59:06,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:59:06,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:59:06,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:59:06,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:59:06,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,469 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,481 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 20:59:06,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:59:06,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:59:06,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:59:06,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:59:06,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (1/1) ... [2023-11-21 20:59:06,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:59:06,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:06,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 20:59:06,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 20:59:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:59:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 20:59:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:59:06,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:59:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-21 20:59:06,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-21 20:59:06,668 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:59:06,671 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:59:07,077 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:59:07,126 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:59:07,126 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 20:59:07,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:07 BoogieIcfgContainer [2023-11-21 20:59:07,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:59:07,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:59:07,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:59:07,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:59:07,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:59:06" (1/3) ... [2023-11-21 20:59:07,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f43bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:07, skipping insertion in model container [2023-11-21 20:59:07,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:06" (2/3) ... [2023-11-21 20:59:07,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f43bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:07, skipping insertion in model container [2023-11-21 20:59:07,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:07" (3/3) ... [2023-11-21 20:59:07,139 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-11-21 20:59:07,159 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:59:07,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-21 20:59:07,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 20:59:07,217 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45cc3ac5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:59:07,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-21 20:59:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 86 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-21 20:59:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 20:59:07,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:07,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:07,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:07,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1695015777, now seen corresponding path program 1 times [2023-11-21 20:59:07,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:07,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714661756] [2023-11-21 20:59:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:07,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714661756] [2023-11-21 20:59:07,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714661756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:07,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:07,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:07,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032124169] [2023-11-21 20:59:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:07,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:07,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:07,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:07,513 INFO L87 Difference]: Start difference. First operand has 103 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 86 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-21 20:59:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:07,659 INFO L93 Difference]: Finished difference Result 165 states and 220 transitions. [2023-11-21 20:59:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2023-11-21 20:59:07,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:07,673 INFO L225 Difference]: With dead ends: 165 [2023-11-21 20:59:07,673 INFO L226 Difference]: Without dead ends: 95 [2023-11-21 20:59:07,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:07,683 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:07,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 122 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:59:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-21 20:59:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-21 20:59:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 51 states have (on average 1.588235294117647) internal successors, (81), 78 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-21 20:59:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2023-11-21 20:59:07,743 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 9 [2023-11-21 20:59:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:07,744 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2023-11-21 20:59:07,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-21 20:59:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2023-11-21 20:59:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 20:59:07,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:07,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:07,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:59:07,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:07,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1005883126, now seen corresponding path program 1 times [2023-11-21 20:59:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900923693] [2023-11-21 20:59:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:07,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900923693] [2023-11-21 20:59:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900923693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:07,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:07,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:59:07,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984163580] [2023-11-21 20:59:07,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:07,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:07,818 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-21 20:59:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:07,865 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2023-11-21 20:59:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:07,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2023-11-21 20:59:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:07,867 INFO L225 Difference]: With dead ends: 179 [2023-11-21 20:59:07,868 INFO L226 Difference]: Without dead ends: 95 [2023-11-21 20:59:07,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:07,871 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:07,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:59:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-21 20:59:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-21 20:59:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 78 states have internal predecessors, (80), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-21 20:59:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2023-11-21 20:59:07,894 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 10 [2023-11-21 20:59:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:07,895 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2023-11-21 20:59:07,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-21 20:59:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2023-11-21 20:59:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 20:59:07,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:07,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:07,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:59:07,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:07,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1005881460, now seen corresponding path program 1 times [2023-11-21 20:59:07,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:07,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928293303] [2023-11-21 20:59:07,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:07,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:07,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:07,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928293303] [2023-11-21 20:59:07,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928293303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:07,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:07,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 20:59:07,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107852419] [2023-11-21 20:59:07,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:07,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:07,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:07,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:07,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:07,972 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2023-11-21 20:59:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:08,032 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2023-11-21 20:59:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:08,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2023-11-21 20:59:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:08,035 INFO L225 Difference]: With dead ends: 95 [2023-11-21 20:59:08,035 INFO L226 Difference]: Without dead ends: 90 [2023-11-21 20:59:08,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:08,037 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:08,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 110 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:59:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-21 20:59:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-21 20:59:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 73 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-21 20:59:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2023-11-21 20:59:08,070 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 10 [2023-11-21 20:59:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:08,070 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2023-11-21 20:59:08,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2023-11-21 20:59:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2023-11-21 20:59:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-21 20:59:08,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:08,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:08,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 20:59:08,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:08,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash -284438866, now seen corresponding path program 1 times [2023-11-21 20:59:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924427026] [2023-11-21 20:59:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:08,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:08,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924427026] [2023-11-21 20:59:08,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924427026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:08,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:08,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:59:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318903730] [2023-11-21 20:59:08,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:08,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:59:08,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:59:08,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:59:08,201 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-11-21 20:59:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:08,349 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2023-11-21 20:59:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 20:59:08,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2023-11-21 20:59:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:08,351 INFO L225 Difference]: With dead ends: 90 [2023-11-21 20:59:08,351 INFO L226 Difference]: Without dead ends: 82 [2023-11-21 20:59:08,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:59:08,353 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 107 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:08,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 116 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:59:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-21 20:59:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-21 20:59:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 65 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-21 20:59:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2023-11-21 20:59:08,389 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 12 [2023-11-21 20:59:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:08,389 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2023-11-21 20:59:08,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-11-21 20:59:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2023-11-21 20:59:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 20:59:08,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:08,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:08,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 20:59:08,391 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:08,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash -227670169, now seen corresponding path program 1 times [2023-11-21 20:59:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296603145] [2023-11-21 20:59:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296603145] [2023-11-21 20:59:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296603145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:59:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11778157] [2023-11-21 20:59:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:08,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:59:08,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:08,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:59:08,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:59:08,488 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-11-21 20:59:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:08,622 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2023-11-21 20:59:08,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 20:59:08,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2023-11-21 20:59:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:08,629 INFO L225 Difference]: With dead ends: 113 [2023-11-21 20:59:08,629 INFO L226 Difference]: Without dead ends: 106 [2023-11-21 20:59:08,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:59:08,643 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 79 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:08,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 189 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:59:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-21 20:59:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-21 20:59:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 82 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-21 20:59:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 135 transitions. [2023-11-21 20:59:08,688 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 135 transitions. Word has length 13 [2023-11-21 20:59:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:08,689 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 135 transitions. [2023-11-21 20:59:08,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-11-21 20:59:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2023-11-21 20:59:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-21 20:59:08,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:08,694 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:08,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 20:59:08,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:08,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash -206142774, now seen corresponding path program 1 times [2023-11-21 20:59:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:08,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832416540] [2023-11-21 20:59:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:08,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-21 20:59:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-21 20:59:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-21 20:59:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832416540] [2023-11-21 20:59:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832416540] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:59:09,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145383416] [2023-11-21 20:59:09,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:09,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:09,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:09,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:59:09,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 20:59:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:09,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 20:59:09,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:59:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-21 20:59:09,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:59:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-21 20:59:09,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145383416] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:59:09,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:59:09,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2023-11-21 20:59:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933639057] [2023-11-21 20:59:09,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:59:09,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 20:59:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:09,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 20:59:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-21 20:59:09,492 INFO L87 Difference]: Start difference. First operand 106 states and 135 transitions. Second operand has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-11-21 20:59:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:10,512 INFO L93 Difference]: Finished difference Result 454 states and 631 transitions. [2023-11-21 20:59:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 20:59:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 53 [2023-11-21 20:59:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:10,518 INFO L225 Difference]: With dead ends: 454 [2023-11-21 20:59:10,519 INFO L226 Difference]: Without dead ends: 448 [2023-11-21 20:59:10,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2023-11-21 20:59:10,521 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1034 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:10,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 409 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-21 20:59:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-11-21 20:59:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2023-11-21 20:59:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 194 states have (on average 1.231958762886598) internal successors, (239), 209 states have internal predecessors, (239), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-21 20:59:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 395 transitions. [2023-11-21 20:59:10,591 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 395 transitions. Word has length 53 [2023-11-21 20:59:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:10,592 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 395 transitions. [2023-11-21 20:59:10,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-11-21 20:59:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 395 transitions. [2023-11-21 20:59:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-21 20:59:10,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:10,596 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:10,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 20:59:10,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:10,813 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:10,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash -86924068, now seen corresponding path program 1 times [2023-11-21 20:59:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:10,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964720994] [2023-11-21 20:59:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 20:59:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-21 20:59:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-21 20:59:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-21 20:59:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-21 20:59:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-21 20:59:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-21 20:59:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964720994] [2023-11-21 20:59:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964720994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:10,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:59:10,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025470822] [2023-11-21 20:59:10,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:10,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:10,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:10,951 INFO L87 Difference]: Start difference. First operand 280 states and 395 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-21 20:59:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:11,049 INFO L93 Difference]: Finished difference Result 398 states and 574 transitions. [2023-11-21 20:59:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 69 [2023-11-21 20:59:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:11,055 INFO L225 Difference]: With dead ends: 398 [2023-11-21 20:59:11,055 INFO L226 Difference]: Without dead ends: 280 [2023-11-21 20:59:11,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:11,060 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:11,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:59:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-21 20:59:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2023-11-21 20:59:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 194 states have (on average 1.2010309278350515) internal successors, (233), 209 states have internal predecessors, (233), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-21 20:59:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 389 transitions. [2023-11-21 20:59:11,120 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 389 transitions. Word has length 69 [2023-11-21 20:59:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:11,122 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 389 transitions. [2023-11-21 20:59:11,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-21 20:59:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 389 transitions. [2023-11-21 20:59:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-21 20:59:11,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:11,132 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:11,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 20:59:11,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:11,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash 764000897, now seen corresponding path program 1 times [2023-11-21 20:59:11,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:11,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016662235] [2023-11-21 20:59:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:11,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 20:59:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 20:59:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 20:59:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-21 20:59:11,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:11,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016662235] [2023-11-21 20:59:11,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016662235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:11,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:11,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:11,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510890757] [2023-11-21 20:59:11,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:11,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:11,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:11,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:11,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:11,324 INFO L87 Difference]: Start difference. First operand 280 states and 389 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-21 20:59:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:11,375 INFO L93 Difference]: Finished difference Result 280 states and 389 transitions. [2023-11-21 20:59:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:11,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2023-11-21 20:59:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:11,379 INFO L225 Difference]: With dead ends: 280 [2023-11-21 20:59:11,379 INFO L226 Difference]: Without dead ends: 279 [2023-11-21 20:59:11,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:11,381 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:11,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 108 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:59:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-21 20:59:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2023-11-21 20:59:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 194 states have (on average 1.175257731958763) internal successors, (228), 208 states have internal predecessors, (228), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-21 20:59:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 384 transitions. [2023-11-21 20:59:11,429 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 384 transitions. Word has length 70 [2023-11-21 20:59:11,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:11,430 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 384 transitions. [2023-11-21 20:59:11,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-21 20:59:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 384 transitions. [2023-11-21 20:59:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-21 20:59:11,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:11,434 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:11,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 20:59:11,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:11,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2085775787, now seen corresponding path program 1 times [2023-11-21 20:59:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201164198] [2023-11-21 20:59:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 20:59:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 20:59:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 20:59:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-21 20:59:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:11,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201164198] [2023-11-21 20:59:11,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201164198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:11,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756411435] [2023-11-21 20:59:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:11,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:11,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:11,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:11,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:11,641 INFO L87 Difference]: Start difference. First operand 279 states and 384 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-21 20:59:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:11,685 INFO L93 Difference]: Finished difference Result 279 states and 384 transitions. [2023-11-21 20:59:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2023-11-21 20:59:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:11,690 INFO L225 Difference]: With dead ends: 279 [2023-11-21 20:59:11,691 INFO L226 Difference]: Without dead ends: 278 [2023-11-21 20:59:11,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:11,694 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:11,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 106 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:59:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-11-21 20:59:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2023-11-21 20:59:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 194 states have (on average 1.1494845360824741) internal successors, (223), 207 states have internal predecessors, (223), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-21 20:59:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 379 transitions. [2023-11-21 20:59:11,739 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 379 transitions. Word has length 71 [2023-11-21 20:59:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:11,740 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 379 transitions. [2023-11-21 20:59:11,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-21 20:59:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 379 transitions. [2023-11-21 20:59:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-21 20:59:11,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:11,743 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:11,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 20:59:11,744 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:11,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash -780292742, now seen corresponding path program 1 times [2023-11-21 20:59:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:11,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83975366] [2023-11-21 20:59:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 20:59:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 20:59:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 20:59:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-21 20:59:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-21 20:59:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-11-21 20:59:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83975366] [2023-11-21 20:59:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83975366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:11,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:11,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:59:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734174360] [2023-11-21 20:59:11,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:11,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:11,870 INFO L87 Difference]: Start difference. First operand 278 states and 379 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-21 20:59:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:11,928 INFO L93 Difference]: Finished difference Result 372 states and 519 transitions. [2023-11-21 20:59:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:11,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2023-11-21 20:59:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:11,935 INFO L225 Difference]: With dead ends: 372 [2023-11-21 20:59:11,935 INFO L226 Difference]: Without dead ends: 278 [2023-11-21 20:59:11,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:11,937 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:11,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:59:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-11-21 20:59:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2023-11-21 20:59:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 194 states have (on average 1.1237113402061856) internal successors, (218), 207 states have internal predecessors, (218), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-21 20:59:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2023-11-21 20:59:11,982 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 79 [2023-11-21 20:59:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:11,983 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2023-11-21 20:59:11,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-21 20:59:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2023-11-21 20:59:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-21 20:59:11,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:11,986 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:11,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 20:59:11,987 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:11,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1508577226, now seen corresponding path program 1 times [2023-11-21 20:59:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774362264] [2023-11-21 20:59:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 20:59:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 20:59:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 20:59:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-21 20:59:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-21 20:59:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-11-21 20:59:12,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:12,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774362264] [2023-11-21 20:59:12,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774362264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:12,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:12,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291738682] [2023-11-21 20:59:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:12,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:12,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:12,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:12,105 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-21 20:59:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:12,162 INFO L93 Difference]: Finished difference Result 339 states and 453 transitions. [2023-11-21 20:59:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:12,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2023-11-21 20:59:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:12,166 INFO L225 Difference]: With dead ends: 339 [2023-11-21 20:59:12,166 INFO L226 Difference]: Without dead ends: 337 [2023-11-21 20:59:12,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:12,167 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:12,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 171 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:59:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-21 20:59:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 336. [2023-11-21 20:59:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 244 states have (on average 1.110655737704918) internal successors, (271), 256 states have internal predecessors, (271), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-21 20:59:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 443 transitions. [2023-11-21 20:59:12,215 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 443 transitions. Word has length 81 [2023-11-21 20:59:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:12,216 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 443 transitions. [2023-11-21 20:59:12,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-21 20:59:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 443 transitions. [2023-11-21 20:59:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-21 20:59:12,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:12,223 INFO L195 NwaCegarLoop]: trace histogram [16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:12,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 20:59:12,223 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:12,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash -898911362, now seen corresponding path program 2 times [2023-11-21 20:59:12,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:12,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528226037] [2023-11-21 20:59:12,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-21 20:59:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-21 20:59:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-21 20:59:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-21 20:59:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-21 20:59:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-21 20:59:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-21 20:59:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-21 20:59:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-21 20:59:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-11-21 20:59:12,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:12,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528226037] [2023-11-21 20:59:12,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528226037] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:59:12,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040459246] [2023-11-21 20:59:12,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 20:59:12,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:12,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:12,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:59:12,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 20:59:12,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 20:59:12,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:59:12,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 20:59:12,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:59:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-11-21 20:59:12,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:59:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-11-21 20:59:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040459246] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:59:13,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:59:13,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-11-21 20:59:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018254180] [2023-11-21 20:59:13,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:59:13,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-21 20:59:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-21 20:59:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2023-11-21 20:59:13,116 INFO L87 Difference]: Start difference. First operand 336 states and 443 transitions. Second operand has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2023-11-21 20:59:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:15,072 INFO L93 Difference]: Finished difference Result 977 states and 1304 transitions. [2023-11-21 20:59:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 20:59:15,073 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 101 [2023-11-21 20:59:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:15,080 INFO L225 Difference]: With dead ends: 977 [2023-11-21 20:59:15,080 INFO L226 Difference]: Without dead ends: 974 [2023-11-21 20:59:15,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=757, Invalid=1499, Unknown=0, NotChecked=0, Total=2256 [2023-11-21 20:59:15,083 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1793 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:15,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 475 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-21 20:59:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-11-21 20:59:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 763. [2023-11-21 20:59:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 559 states have (on average 1.110912343470483) internal successors, (621), 585 states have internal predecessors, (621), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2023-11-21 20:59:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1017 transitions. [2023-11-21 20:59:15,191 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1017 transitions. Word has length 101 [2023-11-21 20:59:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:15,192 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1017 transitions. [2023-11-21 20:59:15,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2023-11-21 20:59:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1017 transitions. [2023-11-21 20:59:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-21 20:59:15,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:15,195 INFO L195 NwaCegarLoop]: trace histogram [18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:15,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 20:59:15,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:15,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:15,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1347694391, now seen corresponding path program 1 times [2023-11-21 20:59:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865106232] [2023-11-21 20:59:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 20:59:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 20:59:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 20:59:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-21 20:59:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-21 20:59:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-21 20:59:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-21 20:59:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-21 20:59:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-21 20:59:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-21 20:59:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-21 20:59:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-11-21 20:59:15,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:15,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865106232] [2023-11-21 20:59:15,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865106232] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:59:15,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029958568] [2023-11-21 20:59:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:15,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:15,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:15,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:59:15,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 20:59:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:15,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 20:59:15,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:59:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-11-21 20:59:15,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 20:59:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029958568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:15,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 20:59:15,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-21 20:59:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386465937] [2023-11-21 20:59:15,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:15,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:59:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:15,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:59:15,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:59:15,753 INFO L87 Difference]: Start difference. First operand 763 states and 1017 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-21 20:59:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:15,864 INFO L93 Difference]: Finished difference Result 764 states and 1017 transitions. [2023-11-21 20:59:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 20:59:15,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 111 [2023-11-21 20:59:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:15,870 INFO L225 Difference]: With dead ends: 764 [2023-11-21 20:59:15,870 INFO L226 Difference]: Without dead ends: 763 [2023-11-21 20:59:15,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:59:15,871 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:15,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 180 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 20:59:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-11-21 20:59:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 762. [2023-11-21 20:59:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 559 states have (on average 1.0912343470483006) internal successors, (610), 584 states have internal predecessors, (610), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2023-11-21 20:59:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1006 transitions. [2023-11-21 20:59:15,963 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1006 transitions. Word has length 111 [2023-11-21 20:59:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:15,964 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 1006 transitions. [2023-11-21 20:59:15,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-21 20:59:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1006 transitions. [2023-11-21 20:59:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-21 20:59:15,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:15,967 INFO L195 NwaCegarLoop]: trace histogram [18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:15,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 20:59:16,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-21 20:59:16,176 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:16,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1171146639, now seen corresponding path program 1 times [2023-11-21 20:59:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101147515] [2023-11-21 20:59:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 20:59:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 20:59:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 20:59:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-21 20:59:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-21 20:59:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-21 20:59:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-21 20:59:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-21 20:59:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-21 20:59:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-21 20:59:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-21 20:59:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-11-21 20:59:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101147515] [2023-11-21 20:59:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101147515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:59:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593609045] [2023-11-21 20:59:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:16,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:59:16,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 20:59:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:16,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 20:59:16,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:59:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-11-21 20:59:16,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:59:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-11-21 20:59:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593609045] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:59:16,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:59:16,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-21 20:59:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048613621] [2023-11-21 20:59:16,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:59:16,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 20:59:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 20:59:16,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:59:16,641 INFO L87 Difference]: Start difference. First operand 762 states and 1006 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2023-11-21 20:59:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:16,866 INFO L93 Difference]: Finished difference Result 1271 states and 1741 transitions. [2023-11-21 20:59:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:59:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 112 [2023-11-21 20:59:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:16,876 INFO L225 Difference]: With dead ends: 1271 [2023-11-21 20:59:16,877 INFO L226 Difference]: Without dead ends: 1270 [2023-11-21 20:59:16,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:59:16,878 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 14 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:16,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 346 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:59:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2023-11-21 20:59:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1266. [2023-11-21 20:59:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 889 states have (on average 1.0877390326209224) internal successors, (967), 941 states have internal predecessors, (967), 372 states have call successors, (372), 1 states have call predecessors, (372), 1 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2023-11-21 20:59:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1711 transitions. [2023-11-21 20:59:17,074 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1711 transitions. Word has length 112 [2023-11-21 20:59:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:17,074 INFO L495 AbstractCegarLoop]: Abstraction has 1266 states and 1711 transitions. [2023-11-21 20:59:17,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2023-11-21 20:59:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1711 transitions. [2023-11-21 20:59:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-21 20:59:17,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:17,082 INFO L195 NwaCegarLoop]: trace histogram [30, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:17,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 20:59:17,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:17,305 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:17,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash -687041031, now seen corresponding path program 3 times [2023-11-21 20:59:17,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:17,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469565347] [2023-11-21 20:59:17,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-21 20:59:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-21 20:59:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-21 20:59:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-21 20:59:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-21 20:59:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-21 20:59:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-21 20:59:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-21 20:59:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-21 20:59:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-21 20:59:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-21 20:59:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-21 20:59:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-21 20:59:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-21 20:59:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-21 20:59:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-21 20:59:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-21 20:59:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-21 20:59:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-21 20:59:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-21 20:59:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-21 20:59:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-21 20:59:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-21 20:59:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2023-11-21 20:59:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469565347] [2023-11-21 20:59:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469565347] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:59:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948322577] [2023-11-21 20:59:17,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 20:59:17,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:17,970 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:59:17,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 20:59:18,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-21 20:59:18,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:59:18,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 20:59:18,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:59:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 52 proven. 37 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2023-11-21 20:59:18,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:59:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 28 proven. 61 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2023-11-21 20:59:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948322577] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:59:18,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:59:18,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5] total 22 [2023-11-21 20:59:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136965300] [2023-11-21 20:59:18,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:59:18,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-21 20:59:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:18,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-21 20:59:18,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2023-11-21 20:59:18,600 INFO L87 Difference]: Start difference. First operand 1266 states and 1711 transitions. Second operand has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 23 states have internal predecessors, (141), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2023-11-21 20:59:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:19,130 INFO L93 Difference]: Finished difference Result 1343 states and 1799 transitions. [2023-11-21 20:59:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 20:59:19,131 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 23 states have internal predecessors, (141), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) Word has length 185 [2023-11-21 20:59:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:19,142 INFO L225 Difference]: With dead ends: 1343 [2023-11-21 20:59:19,142 INFO L226 Difference]: Without dead ends: 1340 [2023-11-21 20:59:19,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=535, Unknown=0, NotChecked=0, Total=812 [2023-11-21 20:59:19,146 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 250 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:19,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 192 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 20:59:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2023-11-21 20:59:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 139. [2023-11-21 20:59:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 105 states have internal predecessors, (106), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-21 20:59:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 182 transitions. [2023-11-21 20:59:19,252 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 182 transitions. Word has length 185 [2023-11-21 20:59:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:19,253 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 182 transitions. [2023-11-21 20:59:19,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.714285714285714) internal successors, (141), 23 states have internal predecessors, (141), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2023-11-21 20:59:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 182 transitions. [2023-11-21 20:59:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2023-11-21 20:59:19,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 20:59:19,256 INFO L195 NwaCegarLoop]: trace histogram [36, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:19,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 20:59:19,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:19,472 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-21 20:59:19,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash -895329714, now seen corresponding path program 2 times [2023-11-21 20:59:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461655962] [2023-11-21 20:59:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 20:59:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 20:59:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 20:59:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 20:59:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 20:59:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-21 20:59:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 20:59:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 20:59:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-21 20:59:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 20:59:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-21 20:59:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-21 20:59:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-21 20:59:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-21 20:59:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-21 20:59:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-21 20:59:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-21 20:59:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-21 20:59:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-21 20:59:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-21 20:59:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-21 20:59:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-21 20:59:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-21 20:59:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-21 20:59:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-21 20:59:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-21 20:59:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-21 20:59:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-21 20:59:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-21 20:59:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-21 20:59:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-21 20:59:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-21 20:59:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-21 20:59:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-21 20:59:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-21 20:59:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-21 20:59:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2023-11-21 20:59:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:19,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461655962] [2023-11-21 20:59:19,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461655962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:59:19,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959046195] [2023-11-21 20:59:19,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 20:59:19,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:19,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:19,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:59:19,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 20:59:20,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 20:59:20,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:59:20,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 20:59:20,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:59:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2023-11-21 20:59:20,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:59:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2023-11-21 20:59:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959046195] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:59:20,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:59:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-11-21 20:59:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19610439] [2023-11-21 20:59:20,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:59:20,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-21 20:59:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-21 20:59:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-11-21 20:59:20,498 INFO L87 Difference]: Start difference. First operand 139 states and 182 transitions. Second operand has 16 states, 15 states have (on average 14.2) internal successors, (213), 16 states have internal predecessors, (213), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2023-11-21 20:59:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:59:20,771 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2023-11-21 20:59:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 20:59:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 14.2) internal successors, (213), 16 states have internal predecessors, (213), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) Word has length 202 [2023-11-21 20:59:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 20:59:20,775 INFO L225 Difference]: With dead ends: 169 [2023-11-21 20:59:20,775 INFO L226 Difference]: Without dead ends: 0 [2023-11-21 20:59:20,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2023-11-21 20:59:20,777 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 28 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 20:59:20,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 676 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 20:59:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-21 20:59:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-21 20:59:20,779 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) [2023-11-21 20:59:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-21 20:59:20,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2023-11-21 20:59:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 20:59:20,780 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-21 20:59:20,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 14.2) internal successors, (213), 16 states have internal predecessors, (213), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2023-11-21 20:59:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-21 20:59:20,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-21 20:59:20,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2023-11-21 20:59:20,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2023-11-21 20:59:20,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2023-11-21 20:59:20,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2023-11-21 20:59:20,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2023-11-21 20:59:20,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2023-11-21 20:59:20,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2023-11-21 20:59:20,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2023-11-21 20:59:20,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2023-11-21 20:59:20,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2023-11-21 20:59:20,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2023-11-21 20:59:20,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2023-11-21 20:59:20,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2023-11-21 20:59:20,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2023-11-21 20:59:20,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2023-11-21 20:59:20,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2023-11-21 20:59:20,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2023-11-21 20:59:20,787 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2023-11-21 20:59:20,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2023-11-21 20:59:20,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2023-11-21 20:59:20,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2023-11-21 20:59:20,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2023-11-21 20:59:20,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2023-11-21 20:59:20,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2023-11-21 20:59:20,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2023-11-21 20:59:20,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2023-11-21 20:59:20,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2023-11-21 20:59:20,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2023-11-21 20:59:20,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2023-11-21 20:59:20,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2023-11-21 20:59:20,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 20:59:21,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:59:21,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-21 20:59:26,805 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2023-11-21 20:59:26,805 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-21 20:59:26,805 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2023-11-21 20:59:26,805 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-11-21 20:59:26,806 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 24 83) no Hoare annotation was computed. [2023-11-21 20:59:26,806 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-11-21 20:59:26,806 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-11-21 20:59:26,806 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-11-21 20:59:26,806 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-11-21 20:59:26,806 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2023-11-21 20:59:26,806 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-11-21 20:59:26,806 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-21 20:59:26,807 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse1 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~scheme~0#1| 1000000))) (or (and (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~cp~0#1| 999999) .cse3) (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) .cse3))) [2023-11-21 20:59:26,807 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2023-11-21 20:59:26,807 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,808 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-21 20:59:26,808 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-21 20:59:26,808 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-11-21 20:59:26,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2023-11-21 20:59:26,808 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2023-11-21 20:59:26,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-21 20:59:26,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2023-11-21 20:59:26,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-21 20:59:26,809 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-21 20:59:26,809 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~c~0#1| 2147483642) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-21 20:59:26,809 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-11-21 20:59:26,809 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~c~0#1| 2147483642) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-21 20:59:26,809 INFO L899 garLoopResultBuilder]: For program point L38-2(line 38) no Hoare annotation was computed. [2023-11-21 20:59:26,809 INFO L899 garLoopResultBuilder]: For program point L38-3(line 38) no Hoare annotation was computed. [2023-11-21 20:59:26,810 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2023-11-21 20:59:26,810 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-21 20:59:26,810 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-21 20:59:26,810 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-21 20:59:26,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-21 20:59:26,810 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2023-11-21 20:59:26,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-21 20:59:26,810 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-21 20:59:26,811 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 52) no Hoare annotation was computed. [2023-11-21 20:59:26,811 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 47 52) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,811 INFO L895 garLoopResultBuilder]: At program point L47-4(lines 47 52) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse1 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~cp~0#1| 999999)) (.cse4 (<= |ULTIMATE.start_main_~scheme~0#1| 1000000))) (or (and (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) .cse4))) [2023-11-21 20:59:26,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-21 20:59:26,811 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~c~0#1| 2147483642) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-21 20:59:26,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-21 20:59:26,812 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-21 20:59:26,812 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2023-11-21 20:59:26,812 INFO L895 garLoopResultBuilder]: At program point L56-2(line 56) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,812 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2023-11-21 20:59:26,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-21 20:59:26,812 INFO L899 garLoopResultBuilder]: For program point L81(lines 25 83) no Hoare annotation was computed. [2023-11-21 20:59:26,812 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-21 20:59:26,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-21 20:59:26,813 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~c~0#1| 2147483642) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-21 20:59:26,813 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-21 20:59:26,813 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-11-21 20:59:26,813 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 66) no Hoare annotation was computed. [2023-11-21 20:59:26,813 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 77) no Hoare annotation was computed. [2023-11-21 20:59:26,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2023-11-21 20:59:26,813 INFO L895 garLoopResultBuilder]: At program point L65-5(lines 65 77) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse2 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse3 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse5 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 2147483642) .cse7) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-21 20:59:26,813 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-11-21 20:59:26,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2023-11-21 20:59:26,814 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,814 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-11-21 20:59:26,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2023-11-21 20:59:26,814 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,814 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point L58-2(line 58) no Hoare annotation was computed. [2023-11-21 20:59:26,815 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2023-11-21 20:59:26,816 INFO L899 garLoopResultBuilder]: For program point L58-3(line 58) no Hoare annotation was computed. [2023-11-21 20:59:26,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2023-11-21 20:59:26,816 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-21 20:59:26,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2023-11-21 20:59:26,816 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2023-11-21 20:59:26,816 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-11-21 20:59:26,816 INFO L895 garLoopResultBuilder]: At program point L42-2(line 42) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,816 INFO L899 garLoopResultBuilder]: For program point L42-3(line 42) no Hoare annotation was computed. [2023-11-21 20:59:26,817 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse2 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse3 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse5 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 999999) .cse7) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-21 20:59:26,817 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-21 20:59:26,817 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse2 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse3 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse4 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse5 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~cp~0#1| 999999)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 999999) .cse7))) [2023-11-21 20:59:26,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-21 20:59:26,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2023-11-21 20:59:26,817 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-21 20:59:26,817 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-11-21 20:59:26,818 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-11-21 20:59:26,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2023-11-21 20:59:26,818 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-21 20:59:26,818 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-11-21 20:59:26,818 INFO L895 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-21 20:59:26,818 INFO L899 garLoopResultBuilder]: For program point L43-2(line 43) no Hoare annotation was computed. [2023-11-21 20:59:26,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-11-21 20:59:26,819 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-21 20:59:26,819 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-11-21 20:59:26,819 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-11-21 20:59:26,819 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-11-21 20:59:26,819 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-11-21 20:59:26,822 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:59:26,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 20:59:26,838 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-21 20:59:26,840 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-21 20:59:26,841 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-21 20:59:26,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 08:59:26 BoogieIcfgContainer [2023-11-21 20:59:26,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 20:59:26,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 20:59:26,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 20:59:26,843 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 20:59:26,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:07" (3/4) ... [2023-11-21 20:59:26,845 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-21 20:59:26,848 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-21 20:59:26,855 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-21 20:59:26,856 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-21 20:59:26,856 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-21 20:59:26,857 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-21 20:59:26,970 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 20:59:26,971 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/witness.yml [2023-11-21 20:59:26,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 20:59:26,972 INFO L158 Benchmark]: Toolchain (without parser) took 20907.55ms. Allocated memory was 115.3MB in the beginning and 373.3MB in the end (delta: 257.9MB). Free memory was 69.5MB in the beginning and 189.7MB in the end (delta: -120.2MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. [2023-11-21 20:59:26,973 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 115.3MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 20:59:26,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.16ms. Allocated memory is still 115.3MB. Free memory was 69.2MB in the beginning and 58.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-21 20:59:26,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.13ms. Allocated memory is still 115.3MB. Free memory was 58.0MB in the beginning and 56.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 20:59:26,974 INFO L158 Benchmark]: Boogie Preprocessor took 51.72ms. Allocated memory is still 115.3MB. Free memory was 56.3MB in the beginning and 54.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 20:59:26,974 INFO L158 Benchmark]: RCFGBuilder took 629.01ms. Allocated memory was 115.3MB in the beginning and 178.3MB in the end (delta: 62.9MB). Free memory was 54.2MB in the beginning and 142.3MB in the end (delta: -88.2MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-11-21 20:59:26,975 INFO L158 Benchmark]: TraceAbstraction took 19710.25ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 142.3MB in the beginning and 196.0MB in the end (delta: -53.7MB). Peak memory consumption was 215.7MB. Max. memory is 16.1GB. [2023-11-21 20:59:26,976 INFO L158 Benchmark]: Witness Printer took 128.84ms. Allocated memory is still 373.3MB. Free memory was 196.0MB in the beginning and 189.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-21 20:59:26,981 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11ms. Allocated memory is still 115.3MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.16ms. Allocated memory is still 115.3MB. Free memory was 69.2MB in the beginning and 58.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.13ms. Allocated memory is still 115.3MB. Free memory was 58.0MB in the beginning and 56.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.72ms. Allocated memory is still 115.3MB. Free memory was 56.3MB in the beginning and 54.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.01ms. Allocated memory was 115.3MB in the beginning and 178.3MB in the end (delta: 62.9MB). Free memory was 54.2MB in the beginning and 142.3MB in the end (delta: -88.2MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19710.25ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 142.3MB in the beginning and 196.0MB in the end (delta: -53.7MB). Peak memory consumption was 215.7MB. Max. memory is 16.1GB. * Witness Printer took 128.84ms. Allocated memory is still 373.3MB. Free memory was 196.0MB in the beginning and 189.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated * 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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3586 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3506 mSDsluCounter, 3755 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2418 mSDsCounter, 1408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1481 IncrementalHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1408 mSolverCounterUnsat, 1337 mSDtfsCounter, 1481 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1892 GetRequests, 1750 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1266occurred in iteration=14, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 1586 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 164 PreInvPairs, 222 NumberOfFragments, 879 HoareAnnotationTreeSize, 164 FomulaSimplifications, 56677 FormulaSimplificationTreeSizeReduction, 4.2s HoareSimplificationTime, 21 FomulaSimplificationsInter, 10184 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1952 NumberOfCodeBlocks, 1802 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2578 ConstructedInterpolants, 0 QuantifiedInterpolants, 5354 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1815 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 10593/12124 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((urilen <= 1000000) && (0 <= (urilen + 1000000))) && (0 <= (1000000 + tokenlen))) && (0 <= cp)) && (0 <= scheme)) && (cp <= 999999)) && (tokenlen <= 1000000)) && (scheme <= 1000000)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((urilen <= 1000000) && (0 <= (urilen + 1000000))) && (1 <= c)) && (0 <= (1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (0 <= scheme)) && (c <= 2147483642)) && (tokenlen <= 1000000)) || ((((((((c == 0) && (urilen <= 1000000)) && (0 <= (urilen + 1000000))) && (0 <= (1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (0 <= scheme)) && (tokenlen <= 1000000))) RESULT: Ultimate proved your program to be correct! [2023-11-21 20:59:27,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf3e76a-1fce-4074-8075-218bee4c4d1c/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE