./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:20:18,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:20:18,815 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-21 22:20:18,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:20:18,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:20:18,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:20:18,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:20:18,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:20:18,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:20:18,884 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:20:18,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:20:18,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:20:18,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:20:18,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:20:18,889 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:20:18,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:20:18,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:20:18,891 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:20:18,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:20:18,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:20:18,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:20:18,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:20:18,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:20:18,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:20:18,895 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-21 22:20:18,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:20:18,896 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:20:18,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:20:18,897 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:20:18,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:20:18,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:20:18,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:20:18,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:20:18,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:20:18,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:20:18,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:20:18,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:20:18,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:20:18,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:20:18,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:20:18,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:20:18,904 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:20:18,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:20:18,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:20:18,906 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_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2023-11-21 22:20:19,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:20:19,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:20:19,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:20:19,265 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:20:19,265 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:20:19,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2023-11-21 22:20:22,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:20:22,811 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:20:22,812 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2023-11-21 22:20:22,831 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/data/ea6c8b762/b97ee2f04fa5450f9ef441dd623e1286/FLAG84bbfa0e3 [2023-11-21 22:20:22,848 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/data/ea6c8b762/b97ee2f04fa5450f9ef441dd623e1286 [2023-11-21 22:20:22,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:20:22,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:20:22,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:20:22,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:20:22,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:20:22,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:20:22" (1/1) ... [2023-11-21 22:20:22,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6598ba9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:22, skipping insertion in model container [2023-11-21 22:20:22,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:20:22" (1/1) ... [2023-11-21 22:20:22,938 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:20:23,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:20:23,234 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:20:23,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:20:23,365 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:20:23,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23 WrapperNode [2023-11-21 22:20:23,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:20:23,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:20:23,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:20:23,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:20:23,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,460 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 860 [2023-11-21 22:20:23,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:20:23,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:20:23,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:20:23,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:20:23,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,479 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,498 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 22:20:23,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:20:23,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:20:23,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:20:23,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:20:23,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (1/1) ... [2023-11-21 22:20:23,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:20:23,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:23,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:20:23,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:20:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:20:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:20:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-21 22:20:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-21 22:20:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:20:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:20:23,910 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:20:23,913 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:20:24,778 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:20:25,019 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:20:25,019 INFO L308 CfgBuilder]: Removed 13 assume(true) statements. [2023-11-21 22:20:25,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:20:25 BoogieIcfgContainer [2023-11-21 22:20:25,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:20:25,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:20:25,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:20:25,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:20:25,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:20:22" (1/3) ... [2023-11-21 22:20:25,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767e8c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:20:25, skipping insertion in model container [2023-11-21 22:20:25,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:20:23" (2/3) ... [2023-11-21 22:20:25,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767e8c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:20:25, skipping insertion in model container [2023-11-21 22:20:25,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:20:25" (3/3) ... [2023-11-21 22:20:25,031 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2023-11-21 22:20:25,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:20:25,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-21 22:20:25,131 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:20:25,138 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;@55a1ad4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:20:25,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-21 22:20:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 224 states have (on average 1.7857142857142858) internal successors, (400), 237 states have internal predecessors, (400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-21 22:20:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-21 22:20:25,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:25,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:25,162 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:25,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 657725894, now seen corresponding path program 1 times [2023-11-21 22:20:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529664205] [2023-11-21 22:20:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529664205] [2023-11-21 22:20:25,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529664205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:25,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:20:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306253969] [2023-11-21 22:20:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:25,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:25,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:25,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:25,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:25,555 INFO L87 Difference]: Start difference. First operand has 239 states, 224 states have (on average 1.7857142857142858) internal successors, (400), 237 states have internal predecessors, (400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:26,133 INFO L93 Difference]: Finished difference Result 642 states and 1088 transitions. [2023-11-21 22:20:26,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2023-11-21 22:20:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:26,152 INFO L225 Difference]: With dead ends: 642 [2023-11-21 22:20:26,152 INFO L226 Difference]: Without dead ends: 389 [2023-11-21 22:20:26,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:26,161 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 221 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:26,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 579 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:20:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-11-21 22:20:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 381. [2023-11-21 22:20:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 373 states have (on average 1.522788203753351) internal successors, (568), 380 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 568 transitions. [2023-11-21 22:20:26,268 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 568 transitions. Word has length 15 [2023-11-21 22:20:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:26,269 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 568 transitions. [2023-11-21 22:20:26,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 568 transitions. [2023-11-21 22:20:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 22:20:26,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:26,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:26,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:20:26,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:26,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2144716238, now seen corresponding path program 1 times [2023-11-21 22:20:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142518474] [2023-11-21 22:20:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:26,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142518474] [2023-11-21 22:20:26,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142518474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:26,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:26,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:20:26,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290151967] [2023-11-21 22:20:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:26,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:26,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:26,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:26,455 INFO L87 Difference]: Start difference. First operand 381 states and 568 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:26,640 INFO L93 Difference]: Finished difference Result 975 states and 1461 transitions. [2023-11-21 22:20:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2023-11-21 22:20:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:26,648 INFO L225 Difference]: With dead ends: 975 [2023-11-21 22:20:26,649 INFO L226 Difference]: Without dead ends: 604 [2023-11-21 22:20:26,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:26,658 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 201 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:26,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 787 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2023-11-21 22:20:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 601. [2023-11-21 22:20:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.4974704890387858) internal successors, (888), 600 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 888 transitions. [2023-11-21 22:20:26,734 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 888 transitions. Word has length 19 [2023-11-21 22:20:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:26,735 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 888 transitions. [2023-11-21 22:20:26,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 888 transitions. [2023-11-21 22:20:26,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-21 22:20:26,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:26,746 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:20:26,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:20:26,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:26,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash -260884645, now seen corresponding path program 1 times [2023-11-21 22:20:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935673886] [2023-11-21 22:20:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:26,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935673886] [2023-11-21 22:20:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935673886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:26,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:20:26,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412277558] [2023-11-21 22:20:26,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:26,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:26,925 INFO L87 Difference]: Start difference. First operand 601 states and 888 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:27,089 INFO L93 Difference]: Finished difference Result 1370 states and 2055 transitions. [2023-11-21 22:20:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:27,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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 48 [2023-11-21 22:20:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:27,095 INFO L225 Difference]: With dead ends: 1370 [2023-11-21 22:20:27,096 INFO L226 Difference]: Without dead ends: 779 [2023-11-21 22:20:27,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:27,109 INFO L413 NwaCegarLoop]: 491 mSDtfsCounter, 337 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:27,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 728 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-11-21 22:20:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 739. [2023-11-21 22:20:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 731 states have (on average 1.5143638850889194) internal successors, (1107), 738 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1107 transitions. [2023-11-21 22:20:27,144 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1107 transitions. Word has length 48 [2023-11-21 22:20:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:27,145 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 1107 transitions. [2023-11-21 22:20:27,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1107 transitions. [2023-11-21 22:20:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-21 22:20:27,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:27,156 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:20:27,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:20:27,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:27,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 412622722, now seen corresponding path program 1 times [2023-11-21 22:20:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:27,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707442794] [2023-11-21 22:20:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:27,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:27,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707442794] [2023-11-21 22:20:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707442794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:27,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:27,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:20:27,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820551471] [2023-11-21 22:20:27,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:27,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:27,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:27,302 INFO L87 Difference]: Start difference. First operand 739 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:27,447 INFO L93 Difference]: Finished difference Result 1790 states and 2691 transitions. [2023-11-21 22:20:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2023-11-21 22:20:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:27,454 INFO L225 Difference]: With dead ends: 1790 [2023-11-21 22:20:27,454 INFO L226 Difference]: Without dead ends: 1061 [2023-11-21 22:20:27,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:27,457 INFO L413 NwaCegarLoop]: 493 mSDtfsCounter, 281 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:27,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 769 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2023-11-21 22:20:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 988. [2023-11-21 22:20:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 980 states have (on average 1.5224489795918368) internal successors, (1492), 987 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1492 transitions. [2023-11-21 22:20:27,499 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1492 transitions. Word has length 51 [2023-11-21 22:20:27,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:27,500 INFO L495 AbstractCegarLoop]: Abstraction has 988 states and 1492 transitions. [2023-11-21 22:20:27,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1492 transitions. [2023-11-21 22:20:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-21 22:20:27,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:27,502 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:20:27,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:20:27,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:27,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 517059276, now seen corresponding path program 1 times [2023-11-21 22:20:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29647106] [2023-11-21 22:20:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:27,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:27,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29647106] [2023-11-21 22:20:27,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29647106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:27,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:20:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022634053] [2023-11-21 22:20:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:27,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:20:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:20:27,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:20:27,611 INFO L87 Difference]: Start difference. First operand 988 states and 1492 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:28,101 INFO L93 Difference]: Finished difference Result 3171 states and 4686 transitions. [2023-11-21 22:20:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:20:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2023-11-21 22:20:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:28,115 INFO L225 Difference]: With dead ends: 3171 [2023-11-21 22:20:28,115 INFO L226 Difference]: Without dead ends: 2191 [2023-11-21 22:20:28,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:28,118 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 563 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:28,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 816 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:20:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2023-11-21 22:20:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1906. [2023-11-21 22:20:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1898 states have (on average 1.4899894625922023) internal successors, (2828), 1905 states have internal predecessors, (2828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2828 transitions. [2023-11-21 22:20:28,245 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2828 transitions. Word has length 63 [2023-11-21 22:20:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:28,247 INFO L495 AbstractCegarLoop]: Abstraction has 1906 states and 2828 transitions. [2023-11-21 22:20:28,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2828 transitions. [2023-11-21 22:20:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-21 22:20:28,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:28,251 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 22:20:28,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:20:28,252 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:28,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash -414965447, now seen corresponding path program 1 times [2023-11-21 22:20:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:28,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199023121] [2023-11-21 22:20:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:28,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:28,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199023121] [2023-11-21 22:20:28,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199023121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:28,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:28,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:20:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880085350] [2023-11-21 22:20:28,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:28,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:28,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:28,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:28,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:28,357 INFO L87 Difference]: Start difference. First operand 1906 states and 2828 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:28,543 INFO L93 Difference]: Finished difference Result 4144 states and 6224 transitions. [2023-11-21 22:20:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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 63 [2023-11-21 22:20:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:28,562 INFO L225 Difference]: With dead ends: 4144 [2023-11-21 22:20:28,562 INFO L226 Difference]: Without dead ends: 2247 [2023-11-21 22:20:28,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:28,569 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 292 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:28,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 504 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2023-11-21 22:20:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2050. [2023-11-21 22:20:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2042 states have (on average 1.5210577864838393) internal successors, (3106), 2049 states have internal predecessors, (3106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3106 transitions. [2023-11-21 22:20:28,677 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3106 transitions. Word has length 63 [2023-11-21 22:20:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:28,679 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 3106 transitions. [2023-11-21 22:20:28,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3106 transitions. [2023-11-21 22:20:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-21 22:20:28,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:28,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:28,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:20:28,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:28,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -495235439, now seen corresponding path program 1 times [2023-11-21 22:20:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101885251] [2023-11-21 22:20:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:28,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101885251] [2023-11-21 22:20:28,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101885251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:28,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:20:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160930281] [2023-11-21 22:20:28,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:28,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:28,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:28,804 INFO L87 Difference]: Start difference. First operand 2050 states and 3106 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:29,133 INFO L93 Difference]: Finished difference Result 4406 states and 6658 transitions. [2023-11-21 22:20:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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 78 [2023-11-21 22:20:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:29,147 INFO L225 Difference]: With dead ends: 4406 [2023-11-21 22:20:29,148 INFO L226 Difference]: Without dead ends: 2365 [2023-11-21 22:20:29,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:29,152 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 162 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:29,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 630 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:20:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2023-11-21 22:20:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2179. [2023-11-21 22:20:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 2171 states have (on average 1.5163519115614923) internal successors, (3292), 2178 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3292 transitions. [2023-11-21 22:20:29,251 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3292 transitions. Word has length 78 [2023-11-21 22:20:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:29,252 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 3292 transitions. [2023-11-21 22:20:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3292 transitions. [2023-11-21 22:20:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-21 22:20:29,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:29,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-21 22:20:29,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:20:29,257 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:29,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash -686977767, now seen corresponding path program 1 times [2023-11-21 22:20:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:29,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269783608] [2023-11-21 22:20:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:29,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-21 22:20:29,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269783608] [2023-11-21 22:20:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269783608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:29,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:20:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787322115] [2023-11-21 22:20:29,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:29,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:20:29,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:20:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:20:29,363 INFO L87 Difference]: Start difference. First operand 2179 states and 3292 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:29,825 INFO L93 Difference]: Finished difference Result 4132 states and 6269 transitions. [2023-11-21 22:20:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:20:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 88 [2023-11-21 22:20:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:29,840 INFO L225 Difference]: With dead ends: 4132 [2023-11-21 22:20:29,840 INFO L226 Difference]: Without dead ends: 2294 [2023-11-21 22:20:29,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:29,844 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 500 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:29,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1044 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:20:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2023-11-21 22:20:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2241. [2023-11-21 22:20:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 2233 states have (on average 1.515450067174205) internal successors, (3384), 2240 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3384 transitions. [2023-11-21 22:20:29,977 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3384 transitions. Word has length 88 [2023-11-21 22:20:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:29,978 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 3384 transitions. [2023-11-21 22:20:29,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3384 transitions. [2023-11-21 22:20:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-21 22:20:29,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:29,987 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-11-21 22:20:29,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:20:29,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:29,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1162914399, now seen corresponding path program 1 times [2023-11-21 22:20:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366655652] [2023-11-21 22:20:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:30,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:30,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366655652] [2023-11-21 22:20:30,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366655652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:30,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:30,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:20:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545192195] [2023-11-21 22:20:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:30,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:30,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:30,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:30,091 INFO L87 Difference]: Start difference. First operand 2241 states and 3384 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:30,461 INFO L93 Difference]: Finished difference Result 5184 states and 7888 transitions. [2023-11-21 22:20:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:30,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2023-11-21 22:20:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:30,481 INFO L225 Difference]: With dead ends: 5184 [2023-11-21 22:20:30,481 INFO L226 Difference]: Without dead ends: 3186 [2023-11-21 22:20:30,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:30,487 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 208 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:30,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 631 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:20:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2023-11-21 22:20:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 2704. [2023-11-21 22:20:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2696 states have (on average 1.4306379821958457) internal successors, (3857), 2703 states have internal predecessors, (3857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3857 transitions. [2023-11-21 22:20:30,634 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3857 transitions. Word has length 88 [2023-11-21 22:20:30,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:30,635 INFO L495 AbstractCegarLoop]: Abstraction has 2704 states and 3857 transitions. [2023-11-21 22:20:30,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3857 transitions. [2023-11-21 22:20:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-21 22:20:30,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:30,638 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:30,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:20:30,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:30,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1232507977, now seen corresponding path program 1 times [2023-11-21 22:20:30,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:30,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955381281] [2023-11-21 22:20:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955381281] [2023-11-21 22:20:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955381281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:30,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:30,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:20:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806797076] [2023-11-21 22:20:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:30,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:30,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:30,762 INFO L87 Difference]: Start difference. First operand 2704 states and 3857 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:30,911 INFO L93 Difference]: Finished difference Result 5155 states and 7392 transitions. [2023-11-21 22:20:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:30,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2023-11-21 22:20:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:30,925 INFO L225 Difference]: With dead ends: 5155 [2023-11-21 22:20:30,926 INFO L226 Difference]: Without dead ends: 2704 [2023-11-21 22:20:30,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:30,930 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 277 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:30,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 326 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2023-11-21 22:20:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2023-11-21 22:20:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2696 states have (on average 1.413946587537092) internal successors, (3812), 2703 states have internal predecessors, (3812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3812 transitions. [2023-11-21 22:20:31,066 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3812 transitions. Word has length 96 [2023-11-21 22:20:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:31,067 INFO L495 AbstractCegarLoop]: Abstraction has 2704 states and 3812 transitions. [2023-11-21 22:20:31,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3812 transitions. [2023-11-21 22:20:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-21 22:20:31,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:31,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2023-11-21 22:20:31,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:20:31,070 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:31,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -833830606, now seen corresponding path program 1 times [2023-11-21 22:20:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794228832] [2023-11-21 22:20:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 22:20:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794228832] [2023-11-21 22:20:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794228832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:20:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272253609] [2023-11-21 22:20:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:31,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:31,118 INFO L87 Difference]: Start difference. First operand 2704 states and 3812 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:31,381 INFO L93 Difference]: Finished difference Result 6662 states and 9465 transitions. [2023-11-21 22:20:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 96 [2023-11-21 22:20:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:31,402 INFO L225 Difference]: With dead ends: 6662 [2023-11-21 22:20:31,402 INFO L226 Difference]: Without dead ends: 3967 [2023-11-21 22:20:31,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:31,407 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 259 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:31,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 728 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2023-11-21 22:20:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3528. [2023-11-21 22:20:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 3520 states have (on average 1.4224431818181817) internal successors, (5007), 3527 states have internal predecessors, (5007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 5007 transitions. [2023-11-21 22:20:31,587 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 5007 transitions. Word has length 96 [2023-11-21 22:20:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:31,587 INFO L495 AbstractCegarLoop]: Abstraction has 3528 states and 5007 transitions. [2023-11-21 22:20:31,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5007 transitions. [2023-11-21 22:20:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-21 22:20:31,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:31,591 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2023-11-21 22:20:31,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:20:31,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:31,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -810869726, now seen corresponding path program 1 times [2023-11-21 22:20:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9024194] [2023-11-21 22:20:31,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:20:31,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:31,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9024194] [2023-11-21 22:20:31,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9024194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:31,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:31,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:20:31,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183253186] [2023-11-21 22:20:31,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:31,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:20:31,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:31,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:20:31,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:20:31,672 INFO L87 Difference]: Start difference. First operand 3528 states and 5007 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:32,140 INFO L93 Difference]: Finished difference Result 8300 states and 11771 transitions. [2023-11-21 22:20:32,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:20:32,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 98 [2023-11-21 22:20:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:32,166 INFO L225 Difference]: With dead ends: 8300 [2023-11-21 22:20:32,166 INFO L226 Difference]: Without dead ends: 4782 [2023-11-21 22:20:32,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:32,173 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 392 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:32,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 794 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:20:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2023-11-21 22:20:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 3957. [2023-11-21 22:20:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3957 states, 3949 states have (on average 1.4099772094201064) internal successors, (5568), 3956 states have internal predecessors, (5568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3957 states and 5568 transitions. [2023-11-21 22:20:32,398 INFO L78 Accepts]: Start accepts. Automaton has 3957 states and 5568 transitions. Word has length 98 [2023-11-21 22:20:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:32,399 INFO L495 AbstractCegarLoop]: Abstraction has 3957 states and 5568 transitions. [2023-11-21 22:20:32,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3957 states and 5568 transitions. [2023-11-21 22:20:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-21 22:20:32,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:32,402 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:32,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:20:32,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:32,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1632844525, now seen corresponding path program 1 times [2023-11-21 22:20:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:32,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951789035] [2023-11-21 22:20:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:20:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951789035] [2023-11-21 22:20:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951789035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:32,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:32,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:20:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512332085] [2023-11-21 22:20:32,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:32,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:32,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:32,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:32,453 INFO L87 Difference]: Start difference. First operand 3957 states and 5568 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:32,719 INFO L93 Difference]: Finished difference Result 7635 states and 10758 transitions. [2023-11-21 22:20:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:32,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 101 [2023-11-21 22:20:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:32,730 INFO L225 Difference]: With dead ends: 7635 [2023-11-21 22:20:32,731 INFO L226 Difference]: Without dead ends: 3782 [2023-11-21 22:20:32,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:32,736 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 250 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:32,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 644 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2023-11-21 22:20:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3720. [2023-11-21 22:20:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3720 states, 3712 states have (on average 1.4094827586206897) internal successors, (5232), 3719 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5232 transitions. [2023-11-21 22:20:32,920 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5232 transitions. Word has length 101 [2023-11-21 22:20:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:32,920 INFO L495 AbstractCegarLoop]: Abstraction has 3720 states and 5232 transitions. [2023-11-21 22:20:32,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5232 transitions. [2023-11-21 22:20:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-21 22:20:32,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:32,924 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:32,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:20:32,924 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:32,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1169507421, now seen corresponding path program 1 times [2023-11-21 22:20:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339505689] [2023-11-21 22:20:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:33,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339505689] [2023-11-21 22:20:33,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339505689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:33,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:33,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:20:33,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126422412] [2023-11-21 22:20:33,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:33,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:20:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:33,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:20:33,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:33,019 INFO L87 Difference]: Start difference. First operand 3720 states and 5232 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:33,535 INFO L93 Difference]: Finished difference Result 10091 states and 14167 transitions. [2023-11-21 22:20:33,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:20:33,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 105 [2023-11-21 22:20:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:33,550 INFO L225 Difference]: With dead ends: 10091 [2023-11-21 22:20:33,550 INFO L226 Difference]: Without dead ends: 6475 [2023-11-21 22:20:33,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:20:33,557 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 513 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:33,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1926 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:20:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6475 states. [2023-11-21 22:20:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6475 to 4496. [2023-11-21 22:20:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 4488 states have (on average 1.4006238859180036) internal successors, (6286), 4495 states have internal predecessors, (6286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6286 transitions. [2023-11-21 22:20:33,823 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6286 transitions. Word has length 105 [2023-11-21 22:20:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:33,823 INFO L495 AbstractCegarLoop]: Abstraction has 4496 states and 6286 transitions. [2023-11-21 22:20:33,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6286 transitions. [2023-11-21 22:20:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-21 22:20:33,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:33,826 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:33,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:20:33,827 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:33,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1528094978, now seen corresponding path program 1 times [2023-11-21 22:20:33,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:33,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141976706] [2023-11-21 22:20:33,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 22:20:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141976706] [2023-11-21 22:20:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141976706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:33,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:20:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085046153] [2023-11-21 22:20:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:33,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:33,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:33,894 INFO L87 Difference]: Start difference. First operand 4496 states and 6286 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:34,088 INFO L93 Difference]: Finished difference Result 6637 states and 9334 transitions. [2023-11-21 22:20:34,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:34,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 107 [2023-11-21 22:20:34,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:34,094 INFO L225 Difference]: With dead ends: 6637 [2023-11-21 22:20:34,094 INFO L226 Difference]: Without dead ends: 2182 [2023-11-21 22:20:34,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:34,100 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 311 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:34,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 442 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2023-11-21 22:20:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2149. [2023-11-21 22:20:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2141 states have (on average 1.355908453993461) internal successors, (2903), 2148 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2903 transitions. [2023-11-21 22:20:34,197 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2903 transitions. Word has length 107 [2023-11-21 22:20:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:34,197 INFO L495 AbstractCegarLoop]: Abstraction has 2149 states and 2903 transitions. [2023-11-21 22:20:34,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2903 transitions. [2023-11-21 22:20:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-21 22:20:34,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:34,200 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:34,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:20:34,200 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:34,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:34,201 INFO L85 PathProgramCache]: Analyzing trace with hash 87353477, now seen corresponding path program 1 times [2023-11-21 22:20:34,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:34,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521982924] [2023-11-21 22:20:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:20:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521982924] [2023-11-21 22:20:34,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521982924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:20:34,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731067642] [2023-11-21 22:20:34,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:34,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:20:34,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:34,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:20:34,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:20:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:34,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:20:34,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:20:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:20:34,604 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:20:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731067642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:34,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:20:34,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-21 22:20:34,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858579362] [2023-11-21 22:20:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:34,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:34,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:34,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:20:34,607 INFO L87 Difference]: Start difference. First operand 2149 states and 2903 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:34,760 INFO L93 Difference]: Finished difference Result 4136 states and 5626 transitions. [2023-11-21 22:20:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:34,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 107 [2023-11-21 22:20:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:34,765 INFO L225 Difference]: With dead ends: 4136 [2023-11-21 22:20:34,766 INFO L226 Difference]: Without dead ends: 2149 [2023-11-21 22:20:34,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:20:34,770 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 230 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:34,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 333 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2023-11-21 22:20:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2149. [2023-11-21 22:20:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2141 states have (on average 1.328351237739374) internal successors, (2844), 2148 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2844 transitions. [2023-11-21 22:20:34,866 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2844 transitions. Word has length 107 [2023-11-21 22:20:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:34,867 INFO L495 AbstractCegarLoop]: Abstraction has 2149 states and 2844 transitions. [2023-11-21 22:20:34,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2844 transitions. [2023-11-21 22:20:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-21 22:20:34,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:34,869 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:34,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:20:35,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-21 22:20:35,086 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:35,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash 992392115, now seen corresponding path program 1 times [2023-11-21 22:20:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:35,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655284715] [2023-11-21 22:20:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:20:35,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:35,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655284715] [2023-11-21 22:20:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655284715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:20:35,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293985347] [2023-11-21 22:20:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:35,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:20:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:20:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:20:35,244 INFO L87 Difference]: Start difference. First operand 2149 states and 2844 transitions. Second operand has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:35,650 INFO L93 Difference]: Finished difference Result 4299 states and 5722 transitions. [2023-11-21 22:20:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:20:35,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 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 109 [2023-11-21 22:20:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:35,662 INFO L225 Difference]: With dead ends: 4299 [2023-11-21 22:20:35,662 INFO L226 Difference]: Without dead ends: 4295 [2023-11-21 22:20:35,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:35,665 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 579 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:35,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 960 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:20:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2023-11-21 22:20:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 3731. [2023-11-21 22:20:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3723 states have (on average 1.3470319634703196) internal successors, (5015), 3730 states have internal predecessors, (5015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 5015 transitions. [2023-11-21 22:20:35,882 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 5015 transitions. Word has length 109 [2023-11-21 22:20:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:35,882 INFO L495 AbstractCegarLoop]: Abstraction has 3731 states and 5015 transitions. [2023-11-21 22:20:35,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 5015 transitions. [2023-11-21 22:20:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-21 22:20:35,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:35,885 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:35,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:20:35,885 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:35,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:35,886 INFO L85 PathProgramCache]: Analyzing trace with hash 495421589, now seen corresponding path program 1 times [2023-11-21 22:20:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291465256] [2023-11-21 22:20:35,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:20:36,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:36,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291465256] [2023-11-21 22:20:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291465256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:20:36,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738508698] [2023-11-21 22:20:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:20:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:36,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:20:36,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:20:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:36,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:20:36,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:20:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 22:20:36,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:20:36,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738508698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:36,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:20:36,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2023-11-21 22:20:36,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267256108] [2023-11-21 22:20:36,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:36,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:20:36,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:36,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:20:36,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:20:36,241 INFO L87 Difference]: Start difference. First operand 3731 states and 5015 transitions. Second operand has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:36,525 INFO L93 Difference]: Finished difference Result 3814 states and 5121 transitions. [2023-11-21 22:20:36,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:20:36,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 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 113 [2023-11-21 22:20:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:36,534 INFO L225 Difference]: With dead ends: 3814 [2023-11-21 22:20:36,534 INFO L226 Difference]: Without dead ends: 3813 [2023-11-21 22:20:36,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:20:36,537 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 261 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:36,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 640 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2023-11-21 22:20:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3730. [2023-11-21 22:20:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3730 states, 3723 states have (on average 1.3454203599247918) internal successors, (5009), 3729 states have internal predecessors, (5009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3730 states and 5009 transitions. [2023-11-21 22:20:36,713 INFO L78 Accepts]: Start accepts. Automaton has 3730 states and 5009 transitions. Word has length 113 [2023-11-21 22:20:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:36,714 INFO L495 AbstractCegarLoop]: Abstraction has 3730 states and 5009 transitions. [2023-11-21 22:20:36,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3730 states and 5009 transitions. [2023-11-21 22:20:36,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-21 22:20:36,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:36,716 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:36,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:20:36,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-21 22:20:36,933 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:36,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:36,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1821799690, now seen corresponding path program 1 times [2023-11-21 22:20:36,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:36,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497453941] [2023-11-21 22:20:36,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:36,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:20:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:37,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497453941] [2023-11-21 22:20:37,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497453941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:20:37,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293948828] [2023-11-21 22:20:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:37,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:20:37,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:37,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:20:37,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:20:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:37,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:20:37,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:20:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-21 22:20:37,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:20:37,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293948828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:37,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:20:37,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-21 22:20:37,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188595069] [2023-11-21 22:20:37,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:37,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:37,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:37,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:20:37,228 INFO L87 Difference]: Start difference. First operand 3730 states and 5009 transitions. Second operand has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:37,476 INFO L93 Difference]: Finished difference Result 3807 states and 5109 transitions. [2023-11-21 22:20:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:37,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 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 114 [2023-11-21 22:20:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:37,485 INFO L225 Difference]: With dead ends: 3807 [2023-11-21 22:20:37,485 INFO L226 Difference]: Without dead ends: 3806 [2023-11-21 22:20:37,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:20:37,487 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 127 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:37,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 648 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2023-11-21 22:20:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3729. [2023-11-21 22:20:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3729 states, 3723 states have (on average 1.343808756379264) internal successors, (5003), 3728 states have internal predecessors, (5003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 3729 states and 5003 transitions. [2023-11-21 22:20:37,651 INFO L78 Accepts]: Start accepts. Automaton has 3729 states and 5003 transitions. Word has length 114 [2023-11-21 22:20:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:37,652 INFO L495 AbstractCegarLoop]: Abstraction has 3729 states and 5003 transitions. [2023-11-21 22:20:37,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3729 states and 5003 transitions. [2023-11-21 22:20:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-21 22:20:37,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:37,661 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:37,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:20:37,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:20:37,883 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:37,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1321344747, now seen corresponding path program 1 times [2023-11-21 22:20:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629774396] [2023-11-21 22:20:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-21 22:20:38,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629774396] [2023-11-21 22:20:38,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629774396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:38,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:38,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:20:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669915743] [2023-11-21 22:20:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:38,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:20:38,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:20:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:38,026 INFO L87 Difference]: Start difference. First operand 3729 states and 5003 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:38,261 INFO L93 Difference]: Finished difference Result 4929 states and 6565 transitions. [2023-11-21 22:20:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:20:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 192 [2023-11-21 22:20:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:38,265 INFO L225 Difference]: With dead ends: 4929 [2023-11-21 22:20:38,265 INFO L226 Difference]: Without dead ends: 1094 [2023-11-21 22:20:38,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:20:38,270 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 120 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:38,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 314 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:20:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2023-11-21 22:20:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1072. [2023-11-21 22:20:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1066 states have (on average 1.122889305816135) internal successors, (1197), 1071 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1197 transitions. [2023-11-21 22:20:38,321 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1197 transitions. Word has length 192 [2023-11-21 22:20:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:38,321 INFO L495 AbstractCegarLoop]: Abstraction has 1072 states and 1197 transitions. [2023-11-21 22:20:38,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1197 transitions. [2023-11-21 22:20:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-11-21 22:20:38,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:38,326 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-21 22:20:38,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-21 22:20:38,326 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:38,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1184810572, now seen corresponding path program 1 times [2023-11-21 22:20:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325512207] [2023-11-21 22:20:38,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-21 22:20:38,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325512207] [2023-11-21 22:20:38,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325512207] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:20:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322144526] [2023-11-21 22:20:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:38,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:20:38,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:20:38,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:20:38,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:20:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:38,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:20:38,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:20:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-21 22:20:38,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:20:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322144526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:20:38,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-21 22:20:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795356144] [2023-11-21 22:20:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:38,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:20:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:20:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:20:38,888 INFO L87 Difference]: Start difference. First operand 1072 states and 1197 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:39,006 INFO L93 Difference]: Finished difference Result 1308 states and 1461 transitions. [2023-11-21 22:20:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:20:39,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 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 207 [2023-11-21 22:20:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:39,008 INFO L225 Difference]: With dead ends: 1308 [2023-11-21 22:20:39,008 INFO L226 Difference]: Without dead ends: 616 [2023-11-21 22:20:39,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:20:39,010 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 220 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:39,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 332 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2023-11-21 22:20:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2023-11-21 22:20:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 614 states have (on average 1.1156351791530945) internal successors, (685), 615 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 685 transitions. [2023-11-21 22:20:39,042 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 685 transitions. Word has length 207 [2023-11-21 22:20:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:39,043 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 685 transitions. [2023-11-21 22:20:39,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 685 transitions. [2023-11-21 22:20:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-11-21 22:20:39,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:39,047 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:39,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:20:39,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-21 22:20:39,261 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:39,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 138408770, now seen corresponding path program 1 times [2023-11-21 22:20:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688246920] [2023-11-21 22:20:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-21 22:20:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688246920] [2023-11-21 22:20:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688246920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:39,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:39,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:20:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551958038] [2023-11-21 22:20:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:39,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:20:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:20:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:39,423 INFO L87 Difference]: Start difference. First operand 616 states and 685 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:39,567 INFO L93 Difference]: Finished difference Result 735 states and 814 transitions. [2023-11-21 22:20:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:20:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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 208 [2023-11-21 22:20:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:39,570 INFO L225 Difference]: With dead ends: 735 [2023-11-21 22:20:39,570 INFO L226 Difference]: Without dead ends: 619 [2023-11-21 22:20:39,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:20:39,571 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 145 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:39,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 684 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2023-11-21 22:20:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 610. [2023-11-21 22:20:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 608 states have (on average 1.1101973684210527) internal successors, (675), 609 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 675 transitions. [2023-11-21 22:20:39,605 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 675 transitions. Word has length 208 [2023-11-21 22:20:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:39,606 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 675 transitions. [2023-11-21 22:20:39,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 675 transitions. [2023-11-21 22:20:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-21 22:20:39,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:20:39,610 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:39,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 22:20:39,610 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-21 22:20:39,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:20:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash 574093925, now seen corresponding path program 1 times [2023-11-21 22:20:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:20:39,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555126027] [2023-11-21 22:20:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:20:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:20:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:20:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-21 22:20:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:20:39,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555126027] [2023-11-21 22:20:39,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555126027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:20:39,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:20:39,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:20:39,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811944454] [2023-11-21 22:20:39,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:20:39,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:20:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:20:39,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:20:39,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:20:39,813 INFO L87 Difference]: Start difference. First operand 610 states and 675 transitions. Second operand has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:20:39,940 INFO L93 Difference]: Finished difference Result 619 states and 684 transitions. [2023-11-21 22:20:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:20:39,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 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 209 [2023-11-21 22:20:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:20:39,941 INFO L225 Difference]: With dead ends: 619 [2023-11-21 22:20:39,941 INFO L226 Difference]: Without dead ends: 0 [2023-11-21 22:20:39,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:20:39,943 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 202 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:20:39,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 413 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:20:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-21 22:20:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-21 22:20:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-21 22:20:39,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 209 [2023-11-21 22:20:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:20:39,945 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-21 22:20:39,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:20:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-21 22:20:39,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-21 22:20:39,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-21 22:20:39,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-21 22:20:39,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-21 22:20:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-21 22:20:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-21 22:20:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-21 22:20:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-21 22:20:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-21 22:20:39,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-21 22:20:39,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-21 22:20:49,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2023-11-21 22:20:49,272 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 764 808) no Hoare annotation was computed. [2023-11-21 22:20:49,272 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2023-11-21 22:20:49,273 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2023-11-21 22:20:49,273 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 772 807) no Hoare annotation was computed. [2023-11-21 22:20:49,273 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2023-11-21 22:20:49,273 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2023-11-21 22:20:49,273 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 780 806) no Hoare annotation was computed. [2023-11-21 22:20:49,273 INFO L899 garLoopResultBuilder]: For program point L829-2(lines 829 835) no Hoare annotation was computed. [2023-11-21 22:20:49,273 INFO L899 garLoopResultBuilder]: For program point L829-3(lines 829 835) no Hoare annotation was computed. [2023-11-21 22:20:49,275 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2023-11-21 22:20:49,275 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 788 805) no Hoare annotation was computed. [2023-11-21 22:20:49,275 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 851 1112) no Hoare annotation was computed. [2023-11-21 22:20:49,276 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 796 804) no Hoare annotation was computed. [2023-11-21 22:20:49,276 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2023-11-21 22:20:49,276 INFO L902 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: true [2023-11-21 22:20:49,276 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2023-11-21 22:20:49,276 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 129) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 364 372) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 818 826) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point $Ultimate##600(lines 1271 1315) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point $Ultimate##606(lines 1279 1314) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1287 1313) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1295 1312) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2023-11-21 22:20:49,277 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1303 1311) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 85 844) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point L174(lines 144 175) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 128) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point $Ultimate##636(lines 1325 1333) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2023-11-21 22:20:49,279 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2023-11-21 22:20:49,280 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2023-11-21 22:20:49,289 INFO L895 garLoopResultBuilder]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse5 (= ~m_run_pc~0 6)) (.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (= ~req_tt_a~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5 (= ~a_t~0 0) .cse9) (and .cse6 .cse0 .cse7 .cse8 (not .cse2) .cse1 (<= 0 ~a_t~0) .cse3 .cse4 .cse9))) [2023-11-21 22:20:49,289 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2023-11-21 22:20:49,290 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-11-21 22:20:49,290 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 127) no Hoare annotation was computed. [2023-11-21 22:20:49,290 INFO L899 garLoopResultBuilder]: For program point L904(lines 878 905) no Hoare annotation was computed. [2023-11-21 22:20:49,295 INFO L895 garLoopResultBuilder]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse8 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8))) [2023-11-21 22:20:49,295 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2023-11-21 22:20:49,296 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2023-11-21 22:20:49,296 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2023-11-21 22:20:49,296 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2023-11-21 22:20:49,296 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2023-11-21 22:20:49,296 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 126) no Hoare annotation was computed. [2023-11-21 22:20:49,297 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2023-11-21 22:20:49,299 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2023-11-21 22:20:49,299 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2023-11-21 22:20:49,300 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2023-11-21 22:20:49,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2023-11-21 22:20:49,300 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 125) no Hoare annotation was computed. [2023-11-21 22:20:49,300 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2023-11-21 22:20:49,300 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2023-11-21 22:20:49,300 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2023-11-21 22:20:49,304 INFO L899 garLoopResultBuilder]: For program point L317(lines 287 318) no Hoare annotation was computed. [2023-11-21 22:20:49,304 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2023-11-21 22:20:49,305 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2023-11-21 22:20:49,305 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2023-11-21 22:20:49,305 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 124) no Hoare annotation was computed. [2023-11-21 22:20:49,305 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2023-11-21 22:20:49,305 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2023-11-21 22:20:49,305 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2023-11-21 22:20:49,306 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 572 616) no Hoare annotation was computed. [2023-11-21 22:20:49,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-21 22:20:49,306 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2023-11-21 22:20:49,306 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2023-11-21 22:20:49,306 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2023-11-21 22:20:49,306 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2023-11-21 22:20:49,306 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2023-11-21 22:20:49,306 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 935 961) no Hoare annotation was computed. [2023-11-21 22:20:49,307 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 446 454) no Hoare annotation was computed. [2023-11-21 22:20:49,307 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2023-11-21 22:20:49,307 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2023-11-21 22:20:49,307 INFO L899 garLoopResultBuilder]: For program point L524(lines 494 525) no Hoare annotation was computed. [2023-11-21 22:20:49,307 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 468 476) no Hoare annotation was computed. [2023-11-21 22:20:49,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2023-11-21 22:20:49,308 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2023-11-21 22:20:49,308 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2023-11-21 22:20:49,308 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2023-11-21 22:20:49,308 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-11-21 22:20:49,308 INFO L899 garLoopResultBuilder]: For program point L131(lines 101 843) no Hoare annotation was computed. [2023-11-21 22:20:49,308 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 386 394) no Hoare annotation was computed. [2023-11-21 22:20:49,309 INFO L895 garLoopResultBuilder]: At program point L528-2(lines 528 556) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2023-11-21 22:20:49,309 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2023-11-21 22:20:49,309 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 414 458) no Hoare annotation was computed. [2023-11-21 22:20:49,309 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2023-11-21 22:20:49,309 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2023-11-21 22:20:49,309 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2023-11-21 22:20:49,309 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2023-11-21 22:20:49,310 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2023-11-21 22:20:49,310 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2023-11-21 22:20:49,310 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 422 457) no Hoare annotation was computed. [2023-11-21 22:20:49,310 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2023-11-21 22:20:49,310 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 430 456) no Hoare annotation was computed. [2023-11-21 22:20:49,310 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2023-11-21 22:20:49,310 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 919 963) no Hoare annotation was computed. [2023-11-21 22:20:49,311 INFO L895 garLoopResultBuilder]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse8 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (<= 0 ~a_t~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_run_pc~0 3) (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse7) (and .cse8 .cse0 (= ~s_run_pc~0 0) .cse1 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse9 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2023-11-21 22:20:49,311 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 927 962) no Hoare annotation was computed. [2023-11-21 22:20:49,311 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 438 455) no Hoare annotation was computed. [2023-11-21 22:20:49,311 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2023-11-21 22:20:49,311 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2023-11-21 22:20:49,312 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2023-11-21 22:20:49,312 INFO L902 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: true [2023-11-21 22:20:49,312 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2023-11-21 22:20:49,312 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2023-11-21 22:20:49,312 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-11-21 22:20:49,312 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 66 69) no Hoare annotation was computed. [2023-11-21 22:20:49,312 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2023-11-21 22:20:49,313 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2023-11-21 22:20:49,313 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2023-11-21 22:20:49,313 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 580 615) no Hoare annotation was computed. [2023-11-21 22:20:49,313 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2023-11-21 22:20:49,313 INFO L899 garLoopResultBuilder]: For program point $Ultimate##550(lines 1041 1085) no Hoare annotation was computed. [2023-11-21 22:20:49,313 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 588 614) no Hoare annotation was computed. [2023-11-21 22:20:49,315 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 596 613) no Hoare annotation was computed. [2023-11-21 22:20:49,315 INFO L899 garLoopResultBuilder]: For program point L864(lines 864 872) no Hoare annotation was computed. [2023-11-21 22:20:49,315 INFO L899 garLoopResultBuilder]: For program point $Ultimate##556(lines 1049 1084) no Hoare annotation was computed. [2023-11-21 22:20:49,315 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2023-11-21 22:20:49,316 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1057 1083) no Hoare annotation was computed. [2023-11-21 22:20:49,316 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 604 612) no Hoare annotation was computed. [2023-11-21 22:20:49,316 INFO L899 garLoopResultBuilder]: For program point L667(lines 637 668) no Hoare annotation was computed. [2023-11-21 22:20:49,316 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2023-11-21 22:20:49,316 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2023-11-21 22:20:49,316 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 943 960) no Hoare annotation was computed. [2023-11-21 22:20:49,316 INFO L899 garLoopResultBuilder]: For program point L867(lines 867 871) no Hoare annotation was computed. [2023-11-21 22:20:49,317 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 951 959) no Hoare annotation was computed. [2023-11-21 22:20:49,317 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2023-11-21 22:20:49,317 INFO L899 garLoopResultBuilder]: For program point L207(lines 177 208) no Hoare annotation was computed. [2023-11-21 22:20:49,317 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2023-11-21 22:20:49,317 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2023-11-21 22:20:49,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2023-11-21 22:20:49,317 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2023-11-21 22:20:49,318 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 973 981) no Hoare annotation was computed. [2023-11-21 22:20:49,318 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2023-11-21 22:20:49,318 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2023-11-21 22:20:49,318 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2023-11-21 22:20:49,319 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 1001 1025) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~a_t~0 0))) (or (and (= ~c_req_type~0 0) .cse0 .cse1 (= 2 ~s_run_pc~0) .cse2 .cse3 .cse4 (= ~m_run_pc~0 6) .cse5 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5))) [2023-11-21 22:20:49,320 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2023-11-21 22:20:49,320 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2023-11-21 22:20:49,320 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2023-11-21 22:20:49,320 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2023-11-21 22:20:49,320 INFO L899 garLoopResultBuilder]: For program point L143-1(line 143) no Hoare annotation was computed. [2023-11-21 22:20:49,320 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2023-11-21 22:20:49,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2023-11-21 22:20:49,321 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2023-11-21 22:20:49,321 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2023-11-21 22:20:49,321 INFO L895 garLoopResultBuilder]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9))) [2023-11-21 22:20:49,321 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-11-21 22:20:49,321 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 74 82) no Hoare annotation was computed. [2023-11-21 22:20:49,322 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2023-11-21 22:20:49,322 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2023-11-21 22:20:49,322 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2023-11-21 22:20:49,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2023-11-21 22:20:49,322 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2023-11-21 22:20:49,322 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2023-11-21 22:20:49,323 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2023-11-21 22:20:49,323 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2023-11-21 22:20:49,323 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2023-11-21 22:20:49,323 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1255 1344) the Hoare annotation is: (let ((.cse1 (= ~c_req_type~0 1)) (.cse9 (= ~s_run_pc~0 0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 0)) (.cse11 (= ~m_run_pc~0 6)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse2 (= ~m_run_st~0 0) .cse10 .cse4 .cse5 (<= ~c_m_lock~0 0) .cse7 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse9 .cse2 (not .cse10) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse3 .cse10 .cse4 .cse5 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse7) (and .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse2 .cse3 .cse10 .cse4 .cse11 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse6 .cse7))) [2023-11-21 22:20:49,323 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2023-11-21 22:20:49,323 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2023-11-21 22:20:49,324 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 876 1106) the Hoare annotation is: (let ((.cse10 (= 2 ~s_run_pc~0))) (let ((.cse4 (= ~m_run_pc~0 3)) (.cse6 (not .cse10)) (.cse7 (not (= ~s_run_st~0 0))) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 (= ~c_req_type~0 1) .cse7 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse0 .cse7 .cse1 (= ~m_run_st~0 0) .cse2 .cse3 .cse8 (<= ~c_m_lock~0 0) .cse5 (= ~m_run_pc~0 0)) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 (= ~m_run_pc~0 6) .cse5 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))))) [2023-11-21 22:20:49,324 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2023-11-21 22:20:49,324 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2023-11-21 22:20:49,324 INFO L899 garLoopResultBuilder]: For program point L481(lines 133 482) no Hoare annotation was computed. [2023-11-21 22:20:49,324 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-11-21 22:20:49,324 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2023-11-21 22:20:49,325 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2023-11-21 22:20:49,325 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1167 1350) no Hoare annotation was computed. [2023-11-21 22:20:49,325 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 879 903) the Hoare annotation is: (let ((.cse4 (= ~m_run_pc~0 3)) (.cse6 (not (= ~s_run_st~0 0))) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse7 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse3 .cse8 .cse4) (and .cse9 .cse0 .cse6 .cse1 .cse7 .cse3 .cse8 .cse10 .cse5) (and .cse0 (= ~c_req_type~0 1) .cse6 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse9 (not .cse7) .cse0 .cse6 .cse1 (= ~m_run_st~0 0) .cse2 .cse3 .cse8 (<= ~c_m_lock~0 0) .cse5 (= ~m_run_pc~0 0)) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse8 .cse10) (and .cse9 .cse0 .cse1 .cse7 .cse2 .cse3 .cse10 .cse5))) [2023-11-21 22:20:49,325 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2023-11-21 22:20:49,325 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2023-11-21 22:20:49,326 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2023-11-21 22:20:49,326 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse1 (= ~c_req_type~0 1)) (.cse9 (= ~s_run_pc~0 0)) (.cse14 (= ~m_run_pc~0 6)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_st~0 0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse12 (<= ~c_m_lock~0 0)) (.cse7 (= ~a_t~0 0)) (.cse13 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse2 .cse10 .cse11 .cse4 .cse5 .cse12 .cse7 .cse13) (and .cse0 .cse1 .cse9 .cse2 (not .cse11) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse3 .cse11 .cse4 .cse5 .cse14) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse7) (and .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse2 .cse3 .cse11 .cse4 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse11 .cse4 .cse6 .cse7) (and .cse8 .cse0 (not (= ~s_run_st~0 0)) .cse2 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse13))) [2023-11-21 22:20:49,326 INFO L902 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: true [2023-11-21 22:20:49,326 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2023-11-21 22:20:49,326 INFO L895 garLoopResultBuilder]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (<= ~c_m_lock~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_run_pc~0 6) (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse6) (and .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)))) [2023-11-21 22:20:49,327 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 332 376) no Hoare annotation was computed. [2023-11-21 22:20:49,327 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2023-11-21 22:20:49,327 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse3 (= ~c_empty_req~0 1))) (let ((.cse2 (= 2 ~s_run_pc~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse8 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse9 (not .cse3)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse6 (= ~a_t~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse2 (<= 0 ~a_t~0) .cse4 .cse10 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse8 (= ~s_run_pc~0 0) .cse1 .cse9 .cse4 .cse10 .cse6 .cse7)))) [2023-11-21 22:20:49,327 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 340 375) no Hoare annotation was computed. [2023-11-21 22:20:49,327 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2023-11-21 22:20:49,327 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 348 374) no Hoare annotation was computed. [2023-11-21 22:20:49,328 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2023-11-21 22:20:49,328 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2023-11-21 22:20:49,328 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2023-11-21 22:20:49,328 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1244 1252) no Hoare annotation was computed. [2023-11-21 22:20:49,328 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2023-11-21 22:20:49,328 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 356 373) no Hoare annotation was computed. [2023-11-21 22:20:49,328 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2023-11-21 22:20:49,329 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2023-11-21 22:20:49,329 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2023-11-21 22:20:49,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2023-11-21 22:20:49,329 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-11-21 22:20:49,329 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2023-11-21 22:20:49,329 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1222 1230) no Hoare annotation was computed. [2023-11-21 22:20:49,329 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1214 1231) no Hoare annotation was computed. [2023-11-21 22:20:49,330 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 238 264) no Hoare annotation was computed. [2023-11-21 22:20:49,330 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 706 723) no Hoare annotation was computed. [2023-11-21 22:20:49,330 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 714 722) no Hoare annotation was computed. [2023-11-21 22:20:49,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2023-11-21 22:20:49,331 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 246 263) no Hoare annotation was computed. [2023-11-21 22:20:49,331 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1206 1232) no Hoare annotation was computed. [2023-11-21 22:20:49,331 INFO L899 garLoopResultBuilder]: For program point L557(lines 527 558) no Hoare annotation was computed. [2023-11-21 22:20:49,331 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 254 262) no Hoare annotation was computed. [2023-11-21 22:20:49,331 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1198 1233) no Hoare annotation was computed. [2023-11-21 22:20:49,331 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2023-11-21 22:20:49,331 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 736 744) no Hoare annotation was computed. [2023-11-21 22:20:49,332 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-21 22:20:49,332 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1190 1234) no Hoare annotation was computed. [2023-11-21 22:20:49,332 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 276 284) no Hoare annotation was computed. [2023-11-21 22:20:49,332 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2023-11-21 22:20:49,332 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2023-11-21 22:20:49,332 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2023-11-21 22:20:49,332 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1065 1082) no Hoare annotation was computed. [2023-11-21 22:20:49,333 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1113 1166) no Hoare annotation was computed. [2023-11-21 22:20:49,333 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2023-11-21 22:20:49,333 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 626 634) no Hoare annotation was computed. [2023-11-21 22:20:49,333 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1073 1081) no Hoare annotation was computed. [2023-11-21 22:20:49,335 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 523) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= ~c_m_lock~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2023-11-21 22:20:49,335 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2023-11-21 22:20:49,335 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2023-11-21 22:20:49,335 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2023-11-21 22:20:49,336 INFO L899 garLoopResultBuilder]: For program point $Ultimate##586(lines 1095 1103) no Hoare annotation was computed. [2023-11-21 22:20:49,336 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2023-11-21 22:20:49,336 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2023-11-21 22:20:49,336 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 682 726) no Hoare annotation was computed. [2023-11-21 22:20:49,336 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2023-11-21 22:20:49,336 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 222 266) no Hoare annotation was computed. [2023-11-21 22:20:49,336 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 690 725) no Hoare annotation was computed. [2023-11-21 22:20:49,337 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 230 265) no Hoare annotation was computed. [2023-11-21 22:20:49,337 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 698 724) no Hoare annotation was computed. [2023-11-21 22:20:49,338 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1000 1027) no Hoare annotation was computed. [2023-11-21 22:20:49,338 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-11-21 22:20:49,338 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-11-21 22:20:49,343 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:20:49,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:20:49,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:20:49 BoogieIcfgContainer [2023-11-21 22:20:49,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:20:49,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:20:49,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:20:49,386 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:20:49,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:20:25" (3/4) ... [2023-11-21 22:20:49,389 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-21 22:20:49,393 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-21 22:20:49,411 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2023-11-21 22:20:49,417 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-21 22:20:49,419 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-21 22:20:49,421 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-21 22:20:49,652 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:20:49,653 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/witness.yml [2023-11-21 22:20:49,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:20:49,654 INFO L158 Benchmark]: Toolchain (without parser) took 26801.66ms. Allocated memory was 153.1MB in the beginning and 580.9MB in the end (delta: 427.8MB). Free memory was 108.0MB in the beginning and 195.7MB in the end (delta: -87.7MB). Peak memory consumption was 342.1MB. Max. memory is 16.1GB. [2023-11-21 22:20:49,654 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 102.8MB. Free memory was 54.4MB in the beginning and 54.2MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:20:49,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.84ms. Allocated memory is still 153.1MB. Free memory was 108.0MB in the beginning and 87.4MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-21 22:20:49,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.55ms. Allocated memory is still 153.1MB. Free memory was 87.4MB in the beginning and 84.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:20:49,656 INFO L158 Benchmark]: Boogie Preprocessor took 110.16ms. Allocated memory is still 153.1MB. Free memory was 84.0MB in the beginning and 79.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 22:20:49,656 INFO L158 Benchmark]: RCFGBuilder took 1439.91ms. Allocated memory is still 153.1MB. Free memory was 79.1MB in the beginning and 100.8MB in the end (delta: -21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-21 22:20:49,656 INFO L158 Benchmark]: TraceAbstraction took 24361.76ms. Allocated memory was 153.1MB in the beginning and 580.9MB in the end (delta: 427.8MB). Free memory was 100.8MB in the beginning and 211.4MB in the end (delta: -110.6MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. [2023-11-21 22:20:49,657 INFO L158 Benchmark]: Witness Printer took 267.43ms. Allocated memory is still 580.9MB. Free memory was 211.4MB in the beginning and 195.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-21 22:20:49,659 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.36ms. Allocated memory is still 102.8MB. Free memory was 54.4MB in the beginning and 54.2MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.84ms. Allocated memory is still 153.1MB. Free memory was 108.0MB in the beginning and 87.4MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.55ms. Allocated memory is still 153.1MB. Free memory was 87.4MB in the beginning and 84.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.16ms. Allocated memory is still 153.1MB. Free memory was 84.0MB in the beginning and 79.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1439.91ms. Allocated memory is still 153.1MB. Free memory was 79.1MB in the beginning and 100.8MB in the end (delta: -21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24361.76ms. Allocated memory was 153.1MB in the beginning and 580.9MB in the end (delta: 427.8MB). Free memory was 100.8MB in the beginning and 211.4MB in the end (delta: -110.6MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. * Witness Printer took 267.43ms. Allocated memory is still 580.9MB. Free memory was 211.4MB in the beginning and 195.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * 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: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: 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, 239 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 24.2s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6651 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6651 mSDsluCounter, 15672 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7482 mSDsCounter, 377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3571 IncrementalHoareTripleChecker+Invalid, 3948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 377 mSolverCounterUnsat, 8190 mSDtfsCounter, 3571 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 635 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4496occurred in iteration=14, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 5420 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 33 PreInvPairs, 173 NumberOfFragments, 1347 HoareAnnotationTreeSize, 33 FomulaSimplifications, 103302 FormulaSimplificationTreeSizeReduction, 5.8s HoareSimplificationTime, 19 FomulaSimplificationsInter, 14053 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2916 NumberOfCodeBlocks, 2916 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2889 ConstructedInterpolants, 0 QuantifiedInterpolants, 5189 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1734 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 627/643 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 8 specifications checked. All of them hold - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (c_m_lock <= 0)) || ((((((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_m_lock <= 0)) && (a == 0))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: ((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_m_lock <= 0)) && (a == 0)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((2 <= c_write_req_ev) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || (((((!((s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) && (c_m_lock <= 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || ((((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) || (((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((2 <= c_write_req_ev) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_m_lock <= 0)) && (a_t == 0)) && (m_run_pc == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-21 22:20:49,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da2e303e-eae8-41d0-b18a-e29f6b27c368/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE