./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 0e0057cc 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_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 05:44:53,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:44:53,200 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 05:44:53,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:44:53,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:44:53,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:44:53,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:44:53,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:44:53,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:44:53,231 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:44:53,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:44:53,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:44:53,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:44:53,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:44:53,234 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:44:53,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:44:53,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:44:53,235 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:44:53,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:44:53,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:44:53,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:44:53,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:44:53,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:44:53,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:44:53,239 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 05:44:53,240 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:44:53,240 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:44:53,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:44:53,241 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:44:53,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:44:53,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:44:53,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:44:53,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:44:53,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:44:53,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:44:53,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:44:53,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:44:53,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:44:53,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:44:53,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:44:53,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:44:53,244 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:44:53,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:44:53,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:44:53,245 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_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/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_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya 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-29 05:44:53,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:44:53,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:44:53,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:44:53,485 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:44:53,486 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:44:53,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-29 05:44:56,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:44:56,401 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:44:56,402 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-29 05:44:56,409 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/data/4dd52241d/dcd843a315824705b7da05c293eec3c8/FLAG40db000a8 [2023-11-29 05:44:56,421 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/data/4dd52241d/dcd843a315824705b7da05c293eec3c8 [2023-11-29 05:44:56,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:44:56,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:44:56,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:44:56,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:44:56,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:44:56,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4f4c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56, skipping insertion in model container [2023-11-29 05:44:56,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,459 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:44:56,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:44:56,640 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:44:56,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:44:56,678 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:44:56,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56 WrapperNode [2023-11-29 05:44:56,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:44:56,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:44:56,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:44:56,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:44:56,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,718 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2023-11-29 05:44:56,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:44:56,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:44:56,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:44:56,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:44:56,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 05:44:56,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:44:56,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:44:56,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:44:56,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:44:56,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (1/1) ... [2023-11-29 05:44:56,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:44:56,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:56,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:44:56,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:44:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:44:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:44:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:44:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:44:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:44:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:44:56,902 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:44:56,904 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:44:57,160 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:44:57,187 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:44:57,187 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:44:57,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:57 BoogieIcfgContainer [2023-11-29 05:44:57,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:44:57,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:44:57,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:44:57,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:44:57,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:44:56" (1/3) ... [2023-11-29 05:44:57,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f273d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:44:57, skipping insertion in model container [2023-11-29 05:44:57,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:56" (2/3) ... [2023-11-29 05:44:57,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f273d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:44:57, skipping insertion in model container [2023-11-29 05:44:57,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:57" (3/3) ... [2023-11-29 05:44:57,198 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-11-29 05:44:57,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:44:57,218 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-29 05:44:57,262 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:44:57,267 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;@3ce439bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:44:57,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-29 05:44:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 57 states have (on average 1.894736842105263) internal successors, (108), 90 states have internal predecessors, (108), 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-29 05:44:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:44:57,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:57,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:57,278 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-29 05:44:57,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1695015777, now seen corresponding path program 1 times [2023-11-29 05:44:57,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:57,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878110237] [2023-11-29 05:44:57,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:57,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:57,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-29 05:44:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:57,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878110237] [2023-11-29 05:44:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878110237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:57,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954700989] [2023-11-29 05:44:57,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:57,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:57,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:57,512 INFO L87 Difference]: Start difference. First operand has 107 states, 57 states have (on average 1.894736842105263) internal successors, (108), 90 states have internal predecessors, (108), 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-29 05:44:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:57,609 INFO L93 Difference]: Finished difference Result 192 states and 279 transitions. [2023-11-29 05:44:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:57,612 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-29 05:44:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:57,637 INFO L225 Difference]: With dead ends: 192 [2023-11-29 05:44:57,637 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 05:44:57,641 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-29 05:44:57,645 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 128 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:57,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 128 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:44:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 05:44:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-29 05:44:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 80 states have internal predecessors, (83), 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-29 05:44:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2023-11-29 05:44:57,712 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 9 [2023-11-29 05:44:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:57,713 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2023-11-29 05:44:57,713 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-29 05:44:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2023-11-29 05:44:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:44:57,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:57,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:57,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:44:57,715 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-29 05:44:57,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1005883126, now seen corresponding path program 1 times [2023-11-29 05:44:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965766547] [2023-11-29 05:44:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:57,757 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-29 05:44:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965766547] [2023-11-29 05:44:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965766547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:57,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:44:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797634241] [2023-11-29 05:44:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:57,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:57,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:57,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:57,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:57,762 INFO L87 Difference]: Start difference. First operand 97 states and 119 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-29 05:44:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:57,792 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2023-11-29 05:44:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:57,793 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-29 05:44:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:57,795 INFO L225 Difference]: With dead ends: 183 [2023-11-29 05:44:57,795 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 05:44:57,796 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-29 05:44:57,798 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:57,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:44:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 05:44:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-29 05:44:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 80 states have internal predecessors, (82), 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-29 05:44:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2023-11-29 05:44:57,817 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 10 [2023-11-29 05:44:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:57,817 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2023-11-29 05:44:57,818 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-29 05:44:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2023-11-29 05:44:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:44:57,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:57,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:57,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:44:57,819 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-29 05:44:57,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1005881460, now seen corresponding path program 1 times [2023-11-29 05:44:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976412038] [2023-11-29 05:44:57,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:57,869 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-29 05:44:57,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976412038] [2023-11-29 05:44:57,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976412038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:57,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:57,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:44:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062518546] [2023-11-29 05:44:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:57,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:57,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:57,872 INFO L87 Difference]: Start difference. First operand 97 states and 118 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-29 05:44:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:57,916 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2023-11-29 05:44:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:57,917 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-29 05:44:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:57,918 INFO L225 Difference]: With dead ends: 97 [2023-11-29 05:44:57,919 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 05:44:57,919 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-29 05:44:57,921 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 65 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:57,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 116 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:44:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 05:44:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-29 05:44:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 75 states have internal predecessors, (77), 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-29 05:44:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2023-11-29 05:44:57,937 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 10 [2023-11-29 05:44:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:57,938 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2023-11-29 05:44:57,938 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-29 05:44:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2023-11-29 05:44:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 05:44:57,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:57,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:57,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:44:57,940 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-29 05:44:57,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:57,941 INFO L85 PathProgramCache]: Analyzing trace with hash -284438866, now seen corresponding path program 1 times [2023-11-29 05:44:57,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:57,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666571487] [2023-11-29 05:44:57,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:57,994 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-29 05:44:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666571487] [2023-11-29 05:44:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666571487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:57,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:57,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:44:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852850625] [2023-11-29 05:44:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:57,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:44:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:44:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:44:57,997 INFO L87 Difference]: Start difference. First operand 92 states and 113 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-29 05:44:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:58,132 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2023-11-29 05:44:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:44:58,133 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-29 05:44:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:58,134 INFO L225 Difference]: With dead ends: 92 [2023-11-29 05:44:58,134 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 05:44:58,134 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-29 05:44:58,136 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 107 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:58,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 125 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 05:44:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-29 05:44:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 67 states have internal predecessors, (69), 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-29 05:44:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2023-11-29 05:44:58,150 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 12 [2023-11-29 05:44:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:58,151 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2023-11-29 05:44:58,151 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-29 05:44:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2023-11-29 05:44:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 05:44:58,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:58,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:58,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:44:58,152 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-29 05:44:58,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash -227670169, now seen corresponding path program 1 times [2023-11-29 05:44:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:58,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355552965] [2023-11-29 05:44:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,199 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-29 05:44:58,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355552965] [2023-11-29 05:44:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355552965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:58,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:58,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:44:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435148576] [2023-11-29 05:44:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:58,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:44:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:44:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:44:58,202 INFO L87 Difference]: Start difference. First operand 84 states and 105 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-29 05:44:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:58,307 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2023-11-29 05:44:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:44:58,308 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-29 05:44:58,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:58,309 INFO L225 Difference]: With dead ends: 115 [2023-11-29 05:44:58,309 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 05:44:58,310 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-29 05:44:58,311 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 79 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:58,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 198 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:44:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 05:44:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-29 05:44:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 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-29 05:44:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2023-11-29 05:44:58,330 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 13 [2023-11-29 05:44:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:58,331 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2023-11-29 05:44:58,331 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-29 05:44:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2023-11-29 05:44:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 05:44:58,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:58,335 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 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-29 05:44:58,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:44:58,335 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-29 05:44:58,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:58,336 INFO L85 PathProgramCache]: Analyzing trace with hash -206244278, now seen corresponding path program 1 times [2023-11-29 05:44:58,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:58,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106155254] [2023-11-29 05:44:58,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:44:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:44:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:44:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:44:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:44:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:44:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:44:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:44:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 05:44:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106155254] [2023-11-29 05:44:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106155254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021911311] [2023-11-29 05:44:58,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:58,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:44:58,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:58,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:44:58,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:44:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:58,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:44:58,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 05:44:58,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 05:44:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021911311] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:44:58,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:44:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2023-11-29 05:44:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043023630] [2023-11-29 05:44:58,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:44:58,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:44:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:44:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:44:58,876 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 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-29 05:44:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:59,770 INFO L93 Difference]: Finished difference Result 456 states and 633 transitions. [2023-11-29 05:44:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:44:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 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 69 [2023-11-29 05:44:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:59,776 INFO L225 Difference]: With dead ends: 456 [2023-11-29 05:44:59,776 INFO L226 Difference]: Without dead ends: 450 [2023-11-29 05:44:59,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 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-29 05:44:59,778 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1048 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:59,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 426 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:44:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-11-29 05:44:59,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 282. [2023-11-29 05:44:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.2295918367346939) internal successors, (241), 211 states have internal predecessors, (241), 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-29 05:44:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 397 transitions. [2023-11-29 05:44:59,830 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 397 transitions. Word has length 69 [2023-11-29 05:44:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:59,831 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 397 transitions. [2023-11-29 05:44:59,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 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-29 05:44:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 397 transitions. [2023-11-29 05:44:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 05:44:59,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:59,834 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 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-29 05:44:59,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:45:00,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:00,036 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-29 05:45:00,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1693853084, now seen corresponding path program 1 times [2023-11-29 05:45:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689116654] [2023-11-29 05:45:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:00,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:45:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:45:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:45:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:45:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 05:45:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:45:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-29 05:45:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:00,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689116654] [2023-11-29 05:45:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689116654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:45:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:45:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407215139] [2023-11-29 05:45:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:00,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:45:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:00,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:45:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:00,122 INFO L87 Difference]: Start difference. First operand 282 states and 397 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-29 05:45:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:00,193 INFO L93 Difference]: Finished difference Result 402 states and 578 transitions. [2023-11-29 05:45:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:45:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 89 [2023-11-29 05:45:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:00,199 INFO L225 Difference]: With dead ends: 402 [2023-11-29 05:45:00,199 INFO L226 Difference]: Without dead ends: 282 [2023-11-29 05:45:00,201 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-29 05:45:00,202 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:00,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:45:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-29 05:45:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2023-11-29 05:45:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.1989795918367347) internal successors, (235), 211 states have internal predecessors, (235), 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-29 05:45:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 391 transitions. [2023-11-29 05:45:00,238 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 391 transitions. Word has length 89 [2023-11-29 05:45:00,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:00,238 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 391 transitions. [2023-11-29 05:45:00,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-29 05:45:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 391 transitions. [2023-11-29 05:45:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 05:45:00,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:00,241 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 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-29 05:45:00,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:45:00,242 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-29 05:45:00,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1071833793, now seen corresponding path program 1 times [2023-11-29 05:45:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369864382] [2023-11-29 05:45:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:45:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:45:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:45:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:45:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-29 05:45:00,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369864382] [2023-11-29 05:45:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369864382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:00,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:45:00,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:45:00,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129311868] [2023-11-29 05:45:00,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:00,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:45:00,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:00,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:45:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:00,356 INFO L87 Difference]: Start difference. First operand 282 states and 391 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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-29 05:45:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:00,394 INFO L93 Difference]: Finished difference Result 282 states and 391 transitions. [2023-11-29 05:45:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:45:00,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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 90 [2023-11-29 05:45:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:00,397 INFO L225 Difference]: With dead ends: 282 [2023-11-29 05:45:00,397 INFO L226 Difference]: Without dead ends: 281 [2023-11-29 05:45:00,397 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-29 05:45:00,398 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:00,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 114 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:45:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-29 05:45:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2023-11-29 05:45:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 196 states have (on average 1.1734693877551021) internal successors, (230), 210 states have internal predecessors, (230), 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-29 05:45:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 386 transitions. [2023-11-29 05:45:00,430 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 386 transitions. Word has length 90 [2023-11-29 05:45:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:00,430 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 386 transitions. [2023-11-29 05:45:00,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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-29 05:45:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 386 transitions. [2023-11-29 05:45:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-29 05:45:00,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:00,433 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 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-29 05:45:00,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:45:00,433 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-29 05:45:00,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1132890603, now seen corresponding path program 1 times [2023-11-29 05:45:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55740720] [2023-11-29 05:45:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:45:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:45:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:45:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:45:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-29 05:45:00,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:00,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55740720] [2023-11-29 05:45:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55740720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:00,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:45:00,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:45:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824441029] [2023-11-29 05:45:00,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:00,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:45:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:00,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:45:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:00,532 INFO L87 Difference]: Start difference. First operand 281 states and 386 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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-29 05:45:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:00,571 INFO L93 Difference]: Finished difference Result 281 states and 386 transitions. [2023-11-29 05:45:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:45:00,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 91 [2023-11-29 05:45:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:00,573 INFO L225 Difference]: With dead ends: 281 [2023-11-29 05:45:00,573 INFO L226 Difference]: Without dead ends: 280 [2023-11-29 05:45:00,574 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-29 05:45:00,574 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:00,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:45:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-29 05:45:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2023-11-29 05:45:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.1479591836734695) internal successors, (225), 209 states have internal predecessors, (225), 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-29 05:45:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2023-11-29 05:45:00,603 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 91 [2023-11-29 05:45:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:00,603 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2023-11-29 05:45:00,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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-29 05:45:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2023-11-29 05:45:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:45:00,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:00,605 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 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-29 05:45:00,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:45:00,605 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-29 05:45:00,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2010672774, now seen corresponding path program 1 times [2023-11-29 05:45:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594944620] [2023-11-29 05:45:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:45:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:45:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:45:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:45:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:45:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:45:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 05:45:00,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:00,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594944620] [2023-11-29 05:45:00,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594944620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:00,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:45:00,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:45:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032648413] [2023-11-29 05:45:00,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:00,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:45:00,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:00,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:45:00,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:00,675 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) 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-29 05:45:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:00,709 INFO L93 Difference]: Finished difference Result 376 states and 523 transitions. [2023-11-29 05:45:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:45:00,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) 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 103 [2023-11-29 05:45:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:00,712 INFO L225 Difference]: With dead ends: 376 [2023-11-29 05:45:00,712 INFO L226 Difference]: Without dead ends: 280 [2023-11-29 05:45:00,713 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-29 05:45:00,713 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 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-29 05:45:00,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:45:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-29 05:45:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2023-11-29 05:45:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.1224489795918366) internal successors, (220), 209 states have internal predecessors, (220), 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-29 05:45:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 376 transitions. [2023-11-29 05:45:00,740 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 376 transitions. Word has length 103 [2023-11-29 05:45:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:00,740 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 376 transitions. [2023-11-29 05:45:00,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) 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-29 05:45:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 376 transitions. [2023-11-29 05:45:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:45:00,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:00,742 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 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-29 05:45:00,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:45:00,742 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-29 05:45:00,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2146032074, now seen corresponding path program 1 times [2023-11-29 05:45:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:00,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756550211] [2023-11-29 05:45:00,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:45:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:45:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:45:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:45:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:45:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:45:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 05:45:00,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756550211] [2023-11-29 05:45:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756550211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:45:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:45:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365111466] [2023-11-29 05:45:00,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:00,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:45:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:00,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:45:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:00,824 INFO L87 Difference]: Start difference. First operand 280 states and 376 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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-29 05:45:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:00,869 INFO L93 Difference]: Finished difference Result 341 states and 455 transitions. [2023-11-29 05:45:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:45:00,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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 105 [2023-11-29 05:45:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:00,872 INFO L225 Difference]: With dead ends: 341 [2023-11-29 05:45:00,872 INFO L226 Difference]: Without dead ends: 339 [2023-11-29 05:45:00,872 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-29 05:45:00,873 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:00,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 177 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:45:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-29 05:45:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2023-11-29 05:45:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.1097560975609757) internal successors, (273), 258 states have internal predecessors, (273), 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-29 05:45:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 445 transitions. [2023-11-29 05:45:00,922 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 445 transitions. Word has length 105 [2023-11-29 05:45:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:00,923 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 445 transitions. [2023-11-29 05:45:00,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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-29 05:45:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2023-11-29 05:45:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 05:45:00,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:00,926 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 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-29 05:45:00,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:45:00,926 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-29 05:45:00,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2135030018, now seen corresponding path program 2 times [2023-11-29 05:45:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830727367] [2023-11-29 05:45:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:45:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:45:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:45:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 05:45:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:45:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 05:45:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 05:45:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:45:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 05:45:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:45:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:45:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830727367] [2023-11-29 05:45:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830727367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925133349] [2023-11-29 05:45:01,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:45:01,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:01,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:01,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:45:01,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:45:01,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:45:01,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:45:01,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:45:01,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:45:01,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:45:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925133349] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:01,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:45:01,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-11-29 05:45:01,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491156886] [2023-11-29 05:45:01,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:01,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 05:45:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 05:45:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:45:01,673 INFO L87 Difference]: Start difference. First operand 338 states and 445 transitions. Second operand has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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-29 05:45:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:03,411 INFO L93 Difference]: Finished difference Result 979 states and 1306 transitions. [2023-11-29 05:45:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 05:45:03,412 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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 133 [2023-11-29 05:45:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:03,419 INFO L225 Difference]: With dead ends: 979 [2023-11-29 05:45:03,420 INFO L226 Difference]: Without dead ends: 976 [2023-11-29 05:45:03,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=757, Invalid=1499, Unknown=0, NotChecked=0, Total=2256 [2023-11-29 05:45:03,422 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1556 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:03,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 570 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:45:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2023-11-29 05:45:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 765. [2023-11-29 05:45:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 561 states have (on average 1.1105169340463459) internal successors, (623), 587 states have internal predecessors, (623), 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-29 05:45:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1019 transitions. [2023-11-29 05:45:03,519 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1019 transitions. Word has length 133 [2023-11-29 05:45:03,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:03,520 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1019 transitions. [2023-11-29 05:45:03,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 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-29 05:45:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1019 transitions. [2023-11-29 05:45:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 05:45:03,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:03,525 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 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-29 05:45:03,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:45:03,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:03,725 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-29 05:45:03,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1539023991, now seen corresponding path program 1 times [2023-11-29 05:45:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:03,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683482741] [2023-11-29 05:45:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:45:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:45:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:45:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:45:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:45:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:45:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 05:45:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:45:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:45:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 05:45:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 05:45:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 05:45:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:45:03,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:03,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683482741] [2023-11-29 05:45:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683482741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040999080] [2023-11-29 05:45:03,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:03,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:03,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:03,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:45:03,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:45:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:03,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:45:03,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:45:04,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:45:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040999080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:45:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-29 05:45:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597985716] [2023-11-29 05:45:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:04,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:45:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:04,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:45:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:45:04,052 INFO L87 Difference]: Start difference. First operand 765 states and 1019 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-29 05:45:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:04,125 INFO L93 Difference]: Finished difference Result 766 states and 1019 transitions. [2023-11-29 05:45:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:45:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 147 [2023-11-29 05:45:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:04,130 INFO L225 Difference]: With dead ends: 766 [2023-11-29 05:45:04,130 INFO L226 Difference]: Without dead ends: 765 [2023-11-29 05:45:04,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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-29 05:45:04,131 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 257 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-29 05:45:04,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 257 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:45:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-11-29 05:45:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 764. [2023-11-29 05:45:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 561 states have (on average 1.0909090909090908) internal successors, (612), 586 states have internal predecessors, (612), 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-29 05:45:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1008 transitions. [2023-11-29 05:45:04,191 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1008 transitions. Word has length 147 [2023-11-29 05:45:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:04,191 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 1008 transitions. [2023-11-29 05:45:04,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-29 05:45:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1008 transitions. [2023-11-29 05:45:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 05:45:04,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:04,194 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 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-29 05:45:04,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:45:04,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:04,395 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-29 05:45:04,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 465103665, now seen corresponding path program 1 times [2023-11-29 05:45:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:04,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868478264] [2023-11-29 05:45:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:45:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:45:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:45:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:45:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:45:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:45:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 05:45:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:45:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:45:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 05:45:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 05:45:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 05:45:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:45:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868478264] [2023-11-29 05:45:04,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868478264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:04,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113508843] [2023-11-29 05:45:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:04,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:04,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:04,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:45:04,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:45:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:04,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:45:04,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:45:04,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:45:04,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113508843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:04,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:45:04,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-29 05:45:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996435861] [2023-11-29 05:45:04,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:04,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:45:04,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:04,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:45:04,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:45:04,801 INFO L87 Difference]: Start difference. First operand 764 states and 1008 transitions. Second operand has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 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-29 05:45:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:04,996 INFO L93 Difference]: Finished difference Result 1273 states and 1743 transitions. [2023-11-29 05:45:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:45:04,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 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 148 [2023-11-29 05:45:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:05,007 INFO L225 Difference]: With dead ends: 1273 [2023-11-29 05:45:05,007 INFO L226 Difference]: Without dead ends: 1272 [2023-11-29 05:45:05,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 328 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-29 05:45:05,009 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 20 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:05,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 278 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:45:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2023-11-29 05:45:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1268. [2023-11-29 05:45:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 891 states have (on average 1.0875420875420876) internal successors, (969), 943 states have internal predecessors, (969), 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-29 05:45:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1713 transitions. [2023-11-29 05:45:05,177 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1713 transitions. Word has length 148 [2023-11-29 05:45:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:05,177 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1713 transitions. [2023-11-29 05:45:05,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 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-29 05:45:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1713 transitions. [2023-11-29 05:45:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-11-29 05:45:05,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:05,185 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 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-29 05:45:05,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:45:05,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 05:45:05,386 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-29 05:45:05,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash -591541447, now seen corresponding path program 3 times [2023-11-29 05:45:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:05,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436077407] [2023-11-29 05:45:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:45:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:45:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:45:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 05:45:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:45:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 05:45:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 05:45:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:45:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 05:45:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:45:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 05:45:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:45:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 05:45:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 05:45:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 05:45:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 05:45:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-29 05:45:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 05:45:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-29 05:45:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 05:45:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-29 05:45:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 05:45:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-29 05:45:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 05:45:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2023-11-29 05:45:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:06,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436077407] [2023-11-29 05:45:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436077407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:06,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198865143] [2023-11-29 05:45:06,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:45:06,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:06,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:06,007 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:45:06,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:45:06,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 05:45:06,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:45:06,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:45:06,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2023-11-29 05:45:06,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 84 proven. 63 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2023-11-29 05:45:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198865143] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:06,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:45:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 24 [2023-11-29 05:45:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105894190] [2023-11-29 05:45:06,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:06,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 05:45:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 05:45:06,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2023-11-29 05:45:06,635 INFO L87 Difference]: Start difference. First operand 1268 states and 1713 transitions. Second operand has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 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-29 05:45:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:07,145 INFO L93 Difference]: Finished difference Result 1345 states and 1801 transitions. [2023-11-29 05:45:07,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:45:07,145 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 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 245 [2023-11-29 05:45:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:07,156 INFO L225 Difference]: With dead ends: 1345 [2023-11-29 05:45:07,157 INFO L226 Difference]: Without dead ends: 1342 [2023-11-29 05:45:07,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2023-11-29 05:45:07,158 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 251 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:07,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 267 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:45:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2023-11-29 05:45:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 141. [2023-11-29 05:45:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 107 states have internal predecessors, (108), 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-29 05:45:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2023-11-29 05:45:07,230 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 245 [2023-11-29 05:45:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:07,231 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2023-11-29 05:45:07,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 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-29 05:45:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2023-11-29 05:45:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-11-29 05:45:07,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:07,235 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 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-29 05:45:07,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 05:45:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 05:45:07,436 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-29 05:45:07,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -958996402, now seen corresponding path program 2 times [2023-11-29 05:45:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:45:07,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429253565] [2023-11-29 05:45:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:07,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:45:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:45:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:45:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:45:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:45:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:45:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:45:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:45:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:45:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:45:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:45:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:45:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:45:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 05:45:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:45:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:45:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 05:45:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 05:45:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 05:45:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 05:45:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 05:45:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 05:45:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 05:45:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 05:45:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 05:45:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 05:45:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 05:45:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:45:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 05:45:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-11-29 05:45:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-11-29 05:45:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-29 05:45:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-29 05:45:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 05:45:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-11-29 05:45:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-29 05:45:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-11-29 05:45:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2023-11-29 05:45:07,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:45:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429253565] [2023-11-29 05:45:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429253565] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847086185] [2023-11-29 05:45:07,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:45:07,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:07,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:07,762 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:45:07,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:45:07,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:45:07,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:45:07,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:45:07,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-29 05:45:08,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-29 05:45:08,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847086185] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:08,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:45:08,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-11-29 05:45:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064352362] [2023-11-29 05:45:08,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:08,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:45:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:45:08,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:45:08,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:45:08,247 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 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-29 05:45:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:08,473 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2023-11-29 05:45:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:45:08,473 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 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 274 [2023-11-29 05:45:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:08,474 INFO L225 Difference]: With dead ends: 171 [2023-11-29 05:45:08,474 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:45:08,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 609 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-29 05:45:08,476 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 49 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:08,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 484 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:45:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:45:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:45:08,478 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-29 05:45:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:45:08,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2023-11-29 05:45:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:08,478 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:45:08,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 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-29 05:45:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:45:08,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:45:08,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2023-11-29 05:45:08,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2023-11-29 05:45:08,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2023-11-29 05:45:08,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2023-11-29 05:45:08,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2023-11-29 05:45:08,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2023-11-29 05:45:08,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2023-11-29 05:45:08,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2023-11-29 05:45:08,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2023-11-29 05:45:08,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2023-11-29 05:45:08,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2023-11-29 05:45:08,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2023-11-29 05:45:08,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2023-11-29 05:45:08,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2023-11-29 05:45:08,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2023-11-29 05:45:08,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2023-11-29 05:45:08,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2023-11-29 05:45:08,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2023-11-29 05:45:08,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2023-11-29 05:45:08,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2023-11-29 05:45:08,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2023-11-29 05:45:08,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2023-11-29 05:45:08,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2023-11-29 05:45:08,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2023-11-29 05:45:08,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2023-11-29 05:45:08,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2023-11-29 05:45:08,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2023-11-29 05:45:08,486 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2023-11-29 05:45:08,486 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2023-11-29 05:45:08,486 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2023-11-29 05:45:08,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:45:08,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:45:08,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:45:12,899 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2023-11-29 05:45:12,899 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-29 05:45:12,899 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2023-11-29 05:45:12,899 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-11-29 05:45:12,899 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 24 83) no Hoare annotation was computed. [2023-11-29 05:45:12,899 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-11-29 05:45:12,899 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-11-29 05:45:12,900 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-11-29 05:45:12,900 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-11-29 05:45:12,900 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2023-11-29 05:45:12,900 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-11-29 05:45:12,900 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-29 05:45:12,900 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-29 05:45:12,901 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2023-11-29 05:45:12,901 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-29 05:45:12,901 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-29 05:45:12,901 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-29 05:45:12,901 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-29 05:45:12,901 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-11-29 05:45:12,901 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2023-11-29 05:45:12,901 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2023-11-29 05:45:12,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-29 05:45:12,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2023-11-29 05:45:12,902 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-29 05:45:12,902 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:45:12,902 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-29 05:45:12,902 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-11-29 05:45:12,902 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-29 05:45:12,903 INFO L899 garLoopResultBuilder]: For program point L38-2(line 38) no Hoare annotation was computed. [2023-11-29 05:45:12,903 INFO L899 garLoopResultBuilder]: For program point L38-3(line 38) no Hoare annotation was computed. [2023-11-29 05:45:12,903 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2023-11-29 05:45:12,903 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-29 05:45:12,903 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-29 05:45:12,903 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-29 05:45:12,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-29 05:45:12,903 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2023-11-29 05:45:12,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-29 05:45:12,904 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-29 05:45:12,904 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 52) no Hoare annotation was computed. [2023-11-29 05:45:12,904 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-29 05:45:12,904 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-29 05:45:12,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-29 05:45:12,904 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-29 05:45:12,904 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-29 05:45:12,904 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-29 05:45:12,905 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2023-11-29 05:45:12,905 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-29 05:45:12,905 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2023-11-29 05:45:12,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-29 05:45:12,905 INFO L899 garLoopResultBuilder]: For program point L81(lines 25 83) no Hoare annotation was computed. [2023-11-29 05:45:12,905 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-29 05:45:12,905 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-29 05:45:12,905 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-29 05:45:12,905 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-29 05:45:12,906 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-11-29 05:45:12,906 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 66) no Hoare annotation was computed. [2023-11-29 05:45:12,906 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 77) no Hoare annotation was computed. [2023-11-29 05:45:12,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2023-11-29 05:45:12,906 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-29 05:45:12,906 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-11-29 05:45:12,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2023-11-29 05:45:12,906 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-29 05:45:12,907 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-11-29 05:45:12,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2023-11-29 05:45:12,907 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-29 05:45:12,907 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-29 05:45:12,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2023-11-29 05:45:12,907 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-29 05:45:12,907 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-11-29 05:45:12,907 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-11-29 05:45:12,907 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point L58-2(line 58) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point L58-3(line 58) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2023-11-29 05:45:12,908 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-11-29 05:45:12,909 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-29 05:45:12,909 INFO L899 garLoopResultBuilder]: For program point L42-3(line 42) no Hoare annotation was computed. [2023-11-29 05:45:12,909 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-29 05:45:12,909 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-29 05:45:12,909 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-29 05:45:12,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-29 05:45:12,909 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2023-11-29 05:45:12,909 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-29 05:45:12,910 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-11-29 05:45:12,910 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-11-29 05:45:12,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2023-11-29 05:45:12,910 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-29 05:45:12,910 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-11-29 05:45:12,910 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-29 05:45:12,910 INFO L899 garLoopResultBuilder]: For program point L43-2(line 43) no Hoare annotation was computed. [2023-11-29 05:45:12,910 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-11-29 05:45:12,910 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 05:45:12,911 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-11-29 05:45:12,911 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-11-29 05:45:12,911 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-11-29 05:45:12,911 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-11-29 05:45:12,911 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-11-29 05:45:12,911 INFO L899 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2023-11-29 05:45:12,911 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-11-29 05:45:12,911 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-11-29 05:45:12,914 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:45:12,916 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:45:12,928 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-29 05:45:12,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-29 05:45:12,930 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-29 05:45:12,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:45:12 BoogieIcfgContainer [2023-11-29 05:45:12,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:45:12,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:45:12,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:45:12,931 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:45:12,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:57" (3/4) ... [2023-11-29 05:45:12,933 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:45:12,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-29 05:45:12,944 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-29 05:45:12,944 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 05:45:12,945 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:45:12,945 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:45:13,040 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:45:13,041 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:45:13,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:45:13,042 INFO L158 Benchmark]: Toolchain (without parser) took 16617.19ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 114.1MB in the beginning and 124.5MB in the end (delta: -10.4MB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. [2023-11-29 05:45:13,042 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:45:13,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.35ms. Allocated memory is still 153.1MB. Free memory was 113.6MB in the beginning and 102.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:45:13,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.67ms. Allocated memory is still 153.1MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:45:13,043 INFO L158 Benchmark]: Boogie Preprocessor took 38.89ms. Allocated memory is still 153.1MB. Free memory was 100.5MB in the beginning and 98.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:45:13,044 INFO L158 Benchmark]: RCFGBuilder took 428.81ms. Allocated memory is still 153.1MB. Free memory was 98.4MB in the beginning and 80.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:45:13,044 INFO L158 Benchmark]: TraceAbstraction took 15739.86ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 80.1MB in the beginning and 130.7MB in the end (delta: -50.7MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. [2023-11-29 05:45:13,044 INFO L158 Benchmark]: Witness Printer took 109.88ms. Allocated memory is still 323.0MB. Free memory was 130.7MB in the beginning and 124.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:45:13,046 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.35ms. Allocated memory is still 153.1MB. Free memory was 113.6MB in the beginning and 102.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.67ms. Allocated memory is still 153.1MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.89ms. Allocated memory is still 153.1MB. Free memory was 100.5MB in the beginning and 98.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 428.81ms. Allocated memory is still 153.1MB. Free memory was 98.4MB in the beginning and 80.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15739.86ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 80.1MB in the beginning and 130.7MB in the end (delta: -50.7MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. * Witness Printer took 109.88ms. Allocated memory is still 323.0MB. Free memory was 130.7MB in the beginning and 124.5MB 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, 107 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3390 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3310 mSDsluCounter, 3831 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2442 mSDsCounter, 1315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1503 IncrementalHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1315 mSolverCounterUnsat, 1389 mSDtfsCounter, 1503 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2361 GetRequests, 2216 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1268occurred in iteration=14, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1586 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 169 PreInvPairs, 227 NumberOfFragments, 879 HoareAnnotationTreeSize, 169 FomulaSimplifications, 56677 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 10184 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2564 NumberOfCodeBlocks, 2355 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3406 ConstructedInterpolants, 0 QuantifiedInterpolants, 6197 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1504 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 19931/21466 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-29 05:45:13,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c198ec6-5bf1-470f-a4e0-92257832928f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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