./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu --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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:00:48,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:00:48,880 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-19 08:00:48,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:00:48,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:00:48,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:00:48,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:00:48,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:00:48,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:00:48,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:00:48,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:00:48,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:00:48,939 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:00:48,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:00:48,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:00:48,942 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:00:48,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:00:48,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:00:48,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:00:48,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:00:48,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:00:48,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:00:48,945 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 08:00:48,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:00:48,946 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:00:48,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:00:48,947 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:00:48,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:00:48,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:00:48,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:00:48,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:48,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:00:48,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:00:48,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:00:48,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:00:48,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:00:48,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:00:48,952 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:00:48,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:00:48,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:00:48,953 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:00:48,953 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_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/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_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2023-11-19 08:00:49,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:00:49,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:00:49,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:00:49,321 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:00:49,322 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:00:49,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2023-11-19 08:00:52,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:00:52,686 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:00:52,686 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2023-11-19 08:00:52,698 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/data/ea288917a/d2372add32ba48fca2eff191170025af/FLAGd323ba9b7 [2023-11-19 08:00:52,715 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/data/ea288917a/d2372add32ba48fca2eff191170025af [2023-11-19 08:00:52,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:00:52,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:00:52,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:52,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:00:52,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:00:52,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:52" (1/1) ... [2023-11-19 08:00:52,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63929c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:52, skipping insertion in model container [2023-11-19 08:00:52,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:52" (1/1) ... [2023-11-19 08:00:52,769 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:00:53,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:53,085 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:00:53,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:53,180 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:00:53,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53 WrapperNode [2023-11-19 08:00:53,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:53,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:53,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:00:53,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:00:53,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,253 INFO L138 Inliner]: procedures = 30, calls = 36, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 234 [2023-11-19 08:00:53,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:53,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:00:53,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:00:53,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:00:53,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:00:53,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:00:53,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:00:53,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:00:53,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (1/1) ... [2023-11-19 08:00:53,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:53,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:53,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:00:53,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:00:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:00:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-19 08:00:53,409 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-19 08:00:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-19 08:00:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-19 08:00:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-19 08:00:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-19 08:00:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-19 08:00:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-19 08:00:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-19 08:00:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-19 08:00:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-19 08:00:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-19 08:00:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:00:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-19 08:00:53,415 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-19 08:00:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:00:53,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:00:53,551 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:00:53,554 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:00:53,927 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:00:53,937 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:00:53,937 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 08:00:53,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:53 BoogieIcfgContainer [2023-11-19 08:00:53,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:00:53,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:00:53,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:00:53,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:00:53,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:00:52" (1/3) ... [2023-11-19 08:00:53,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c080f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:00:53, skipping insertion in model container [2023-11-19 08:00:53,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:53" (2/3) ... [2023-11-19 08:00:53,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c080f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:00:53, skipping insertion in model container [2023-11-19 08:00:53,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:53" (3/3) ... [2023-11-19 08:00:53,956 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2023-11-19 08:00:53,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:00:53,978 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-19 08:00:54,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:00:54,045 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;@7184238d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:00:54,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 08:00:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 102 states have internal predecessors, (147), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-19 08:00:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 08:00:54,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:54,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:00:54,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:00:54,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1551110128, now seen corresponding path program 1 times [2023-11-19 08:00:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512154935] [2023-11-19 08:00:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:54,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:54,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:00:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:54,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:00:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:00:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:00:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:00:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:54,657 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-19 08:00:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:54,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512154935] [2023-11-19 08:00:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512154935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:54,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:00:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552200477] [2023-11-19 08:00:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:54,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:00:54,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:54,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:00:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:00:54,703 INFO L87 Difference]: Start difference. First operand has 124 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 102 states have internal predecessors, (147), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:00:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:55,513 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2023-11-19 08:00:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:00:55,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-19 08:00:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:55,531 INFO L225 Difference]: With dead ends: 386 [2023-11-19 08:00:55,531 INFO L226 Difference]: Without dead ends: 257 [2023-11-19 08:00:55,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-19 08:00:55,540 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 321 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:55,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 477 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 08:00:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-19 08:00:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 214. [2023-11-19 08:00:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 172 states have (on average 1.4651162790697674) internal successors, (252), 177 states have internal predecessors, (252), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-19 08:00:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 305 transitions. [2023-11-19 08:00:55,623 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 305 transitions. Word has length 55 [2023-11-19 08:00:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:55,623 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 305 transitions. [2023-11-19 08:00:55,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:00:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 305 transitions. [2023-11-19 08:00:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 08:00:55,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:55,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:00:55,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:00:55,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:00:55,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash 913324044, now seen corresponding path program 1 times [2023-11-19 08:00:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648152796] [2023-11-19 08:00:55,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:00:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:55,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:00:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:00:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:00:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:00:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:55,887 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-19 08:00:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:55,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648152796] [2023-11-19 08:00:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648152796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:55,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:55,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:00:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689458598] [2023-11-19 08:00:55,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:55,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:00:55,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:55,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:00:55,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:00:55,894 INFO L87 Difference]: Start difference. First operand 214 states and 305 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:00:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:56,746 INFO L93 Difference]: Finished difference Result 580 states and 828 transitions. [2023-11-19 08:00:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 08:00:56,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-19 08:00:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:56,758 INFO L225 Difference]: With dead ends: 580 [2023-11-19 08:00:56,759 INFO L226 Difference]: Without dead ends: 375 [2023-11-19 08:00:56,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-19 08:00:56,769 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 302 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:56,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 799 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 08:00:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-11-19 08:00:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 309. [2023-11-19 08:00:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 250 states have (on average 1.456) internal successors, (364), 256 states have internal predecessors, (364), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2023-11-19 08:00:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 439 transitions. [2023-11-19 08:00:56,849 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 439 transitions. Word has length 55 [2023-11-19 08:00:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:56,849 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 439 transitions. [2023-11-19 08:00:56,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:00:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 439 transitions. [2023-11-19 08:00:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 08:00:56,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:56,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:00:56,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:00:56,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:00:56,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash 15930766, now seen corresponding path program 1 times [2023-11-19 08:00:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:56,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237542828] [2023-11-19 08:00:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:00:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:00:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:00:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:57,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:00:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:57,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:00:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:57,056 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-19 08:00:57,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:57,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237542828] [2023-11-19 08:00:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237542828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:57,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:57,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:00:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714457189] [2023-11-19 08:00:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:57,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:00:57,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:00:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:00:57,062 INFO L87 Difference]: Start difference. First operand 309 states and 439 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:00:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:57,908 INFO L93 Difference]: Finished difference Result 946 states and 1346 transitions. [2023-11-19 08:00:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 08:00:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-19 08:00:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:57,917 INFO L225 Difference]: With dead ends: 946 [2023-11-19 08:00:57,918 INFO L226 Difference]: Without dead ends: 646 [2023-11-19 08:00:57,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-19 08:00:57,928 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 357 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:57,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 787 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 08:00:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2023-11-19 08:00:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 492. [2023-11-19 08:00:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 401 states have (on average 1.4438902743142146) internal successors, (579), 409 states have internal predecessors, (579), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2023-11-19 08:00:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 698 transitions. [2023-11-19 08:00:57,984 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 698 transitions. Word has length 55 [2023-11-19 08:00:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:57,985 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 698 transitions. [2023-11-19 08:00:57,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:00:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 698 transitions. [2023-11-19 08:00:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 08:00:57,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:57,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:00:57,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:00:57,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:00:57,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash 264077260, now seen corresponding path program 1 times [2023-11-19 08:00:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:57,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112116102] [2023-11-19 08:00:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:00:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:00:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:00:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:00:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:00:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:58,163 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-19 08:00:58,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:58,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112116102] [2023-11-19 08:00:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112116102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:58,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:58,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:00:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393552861] [2023-11-19 08:00:58,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:58,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:00:58,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:58,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:00:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:00:58,167 INFO L87 Difference]: Start difference. First operand 492 states and 698 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:00:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:59,183 INFO L93 Difference]: Finished difference Result 1522 states and 2161 transitions. [2023-11-19 08:00:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 08:00:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-19 08:00:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:59,197 INFO L225 Difference]: With dead ends: 1522 [2023-11-19 08:00:59,197 INFO L226 Difference]: Without dead ends: 1039 [2023-11-19 08:00:59,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-19 08:00:59,205 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 297 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:59,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 757 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 08:00:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2023-11-19 08:00:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 801. [2023-11-19 08:00:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 652 states have (on average 1.4248466257668713) internal successors, (929), 664 states have internal predecessors, (929), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2023-11-19 08:00:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1134 transitions. [2023-11-19 08:00:59,288 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1134 transitions. Word has length 55 [2023-11-19 08:00:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:59,293 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1134 transitions. [2023-11-19 08:00:59,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:00:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1134 transitions. [2023-11-19 08:00:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 08:00:59,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:59,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:00:59,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:00:59,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:00:59,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash 687723982, now seen corresponding path program 1 times [2023-11-19 08:00:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:59,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196809512] [2023-11-19 08:00:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:59,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:00:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:00:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:00:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:59,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:00:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:59,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:00:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:59,459 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-19 08:00:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:59,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196809512] [2023-11-19 08:00:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196809512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:59,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:59,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:00:59,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882031868] [2023-11-19 08:00:59,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:59,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:00:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:00:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:00:59,468 INFO L87 Difference]: Start difference. First operand 801 states and 1134 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:00,224 INFO L93 Difference]: Finished difference Result 2213 states and 3139 transitions. [2023-11-19 08:01:00,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:01:00,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-11-19 08:01:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:00,235 INFO L225 Difference]: With dead ends: 2213 [2023-11-19 08:01:00,235 INFO L226 Difference]: Without dead ends: 1422 [2023-11-19 08:01:00,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-19 08:01:00,240 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 420 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:00,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 538 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 08:01:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2023-11-19 08:01:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1215. [2023-11-19 08:01:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 983 states have (on average 1.397761953204476) internal successors, (1374), 1004 states have internal predecessors, (1374), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2023-11-19 08:01:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1687 transitions. [2023-11-19 08:01:00,368 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1687 transitions. Word has length 55 [2023-11-19 08:01:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:00,368 INFO L495 AbstractCegarLoop]: Abstraction has 1215 states and 1687 transitions. [2023-11-19 08:01:00,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1687 transitions. [2023-11-19 08:01:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 08:01:00,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:00,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:01:00,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:01:00,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:00,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -987112854, now seen corresponding path program 1 times [2023-11-19 08:01:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281334587] [2023-11-19 08:01:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:00,537 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-19 08:01:00,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:00,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281334587] [2023-11-19 08:01:00,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281334587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:00,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:00,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:01:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252833181] [2023-11-19 08:01:00,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:00,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:01:00,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:01:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:01:00,540 INFO L87 Difference]: Start difference. First operand 1215 states and 1687 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:01,081 INFO L93 Difference]: Finished difference Result 2637 states and 3715 transitions. [2023-11-19 08:01:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 08:01:01,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2023-11-19 08:01:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:01,092 INFO L225 Difference]: With dead ends: 2637 [2023-11-19 08:01:01,092 INFO L226 Difference]: Without dead ends: 1432 [2023-11-19 08:01:01,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-19 08:01:01,100 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 157 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:01,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 542 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:01:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2023-11-19 08:01:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1230. [2023-11-19 08:01:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 998 states have (on average 1.3827655310621243) internal successors, (1380), 1019 states have internal predecessors, (1380), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2023-11-19 08:01:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1693 transitions. [2023-11-19 08:01:01,229 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1693 transitions. Word has length 56 [2023-11-19 08:01:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:01,230 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1693 transitions. [2023-11-19 08:01:01,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1693 transitions. [2023-11-19 08:01:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 08:01:01,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:01,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:01:01,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:01:01,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:01,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:01,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1059499412, now seen corresponding path program 1 times [2023-11-19 08:01:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837076813] [2023-11-19 08:01:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:01,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:01,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:01,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:01,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:01,342 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-19 08:01:01,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:01,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837076813] [2023-11-19 08:01:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837076813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:01,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:01,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:01:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164776023] [2023-11-19 08:01:01,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:01,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:01:01,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:01,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:01:01,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:01:01,345 INFO L87 Difference]: Start difference. First operand 1230 states and 1693 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:01,836 INFO L93 Difference]: Finished difference Result 2692 states and 3760 transitions. [2023-11-19 08:01:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:01:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2023-11-19 08:01:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:01,846 INFO L225 Difference]: With dead ends: 2692 [2023-11-19 08:01:01,846 INFO L226 Difference]: Without dead ends: 1472 [2023-11-19 08:01:01,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-11-19 08:01:01,851 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 129 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:01,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 537 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:01:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2023-11-19 08:01:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1272. [2023-11-19 08:01:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1040 states have (on average 1.3673076923076923) internal successors, (1422), 1061 states have internal predecessors, (1422), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2023-11-19 08:01:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1735 transitions. [2023-11-19 08:01:01,970 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1735 transitions. Word has length 56 [2023-11-19 08:01:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:01,971 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1735 transitions. [2023-11-19 08:01:01,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1735 transitions. [2023-11-19 08:01:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 08:01:01,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:01,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:01:01,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:01:01,973 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:01,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash 863728622, now seen corresponding path program 1 times [2023-11-19 08:01:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039281740] [2023-11-19 08:01:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,111 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-19 08:01:02,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:02,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039281740] [2023-11-19 08:01:02,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039281740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:02,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:02,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 08:01:02,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617223226] [2023-11-19 08:01:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:02,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:01:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:01:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:02,114 INFO L87 Difference]: Start difference. First operand 1272 states and 1735 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:02,736 INFO L93 Difference]: Finished difference Result 1838 states and 2509 transitions. [2023-11-19 08:01:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 08:01:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2023-11-19 08:01:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:02,746 INFO L225 Difference]: With dead ends: 1838 [2023-11-19 08:01:02,746 INFO L226 Difference]: Without dead ends: 1088 [2023-11-19 08:01:02,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-19 08:01:02,750 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 464 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:02,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 514 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 08:01:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-11-19 08:01:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 918. [2023-11-19 08:01:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 749 states have (on average 1.356475300400534) internal successors, (1016), 763 states have internal predecessors, (1016), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2023-11-19 08:01:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1231 transitions. [2023-11-19 08:01:02,816 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1231 transitions. Word has length 56 [2023-11-19 08:01:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:02,817 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1231 transitions. [2023-11-19 08:01:02,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1231 transitions. [2023-11-19 08:01:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 08:01:02,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:02,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:01:02,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:01:02,819 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:02,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:02,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1082583340, now seen corresponding path program 1 times [2023-11-19 08:01:02,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:02,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662326044] [2023-11-19 08:01:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:02,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:03,017 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-19 08:01:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662326044] [2023-11-19 08:01:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662326044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:03,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 08:01:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230585693] [2023-11-19 08:01:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:03,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:01:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:01:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:03,021 INFO L87 Difference]: Start difference. First operand 918 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:03,872 INFO L93 Difference]: Finished difference Result 1779 states and 2393 transitions. [2023-11-19 08:01:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 08:01:03,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2023-11-19 08:01:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:03,881 INFO L225 Difference]: With dead ends: 1779 [2023-11-19 08:01:03,881 INFO L226 Difference]: Without dead ends: 1116 [2023-11-19 08:01:03,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-11-19 08:01:03,887 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 371 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:03,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 583 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 08:01:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2023-11-19 08:01:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 912. [2023-11-19 08:01:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 745 states have (on average 1.3516778523489932) internal successors, (1007), 757 states have internal predecessors, (1007), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2023-11-19 08:01:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1214 transitions. [2023-11-19 08:01:03,967 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1214 transitions. Word has length 56 [2023-11-19 08:01:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:03,967 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1214 transitions. [2023-11-19 08:01:03,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1214 transitions. [2023-11-19 08:01:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 08:01:03,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:03,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:01:03,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:01:03,969 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:03,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1505285166, now seen corresponding path program 1 times [2023-11-19 08:01:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:03,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464824246] [2023-11-19 08:01:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,144 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-19 08:01:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464824246] [2023-11-19 08:01:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464824246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:04,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 08:01:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550071069] [2023-11-19 08:01:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:04,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:01:04,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:04,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:01:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:04,148 INFO L87 Difference]: Start difference. First operand 912 states and 1214 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:04,780 INFO L93 Difference]: Finished difference Result 1721 states and 2289 transitions. [2023-11-19 08:01:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 08:01:04,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2023-11-19 08:01:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:04,786 INFO L225 Difference]: With dead ends: 1721 [2023-11-19 08:01:04,787 INFO L226 Difference]: Without dead ends: 968 [2023-11-19 08:01:04,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-19 08:01:04,790 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 411 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:04,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 546 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 08:01:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2023-11-19 08:01:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 796. [2023-11-19 08:01:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 654 states have (on average 1.348623853211009) internal successors, (882), 664 states have internal predecessors, (882), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2023-11-19 08:01:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1054 transitions. [2023-11-19 08:01:04,862 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1054 transitions. Word has length 56 [2023-11-19 08:01:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:04,862 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1054 transitions. [2023-11-19 08:01:04,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1054 transitions. [2023-11-19 08:01:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-19 08:01:04,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:04,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:01:04,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:01:04,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:04,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash 687636716, now seen corresponding path program 1 times [2023-11-19 08:01:04,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190833291] [2023-11-19 08:01:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:04,949 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-19 08:01:04,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:04,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190833291] [2023-11-19 08:01:04,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190833291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:04,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:04,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:04,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874217250] [2023-11-19 08:01:04,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:04,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:01:04,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:01:04,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:01:04,952 INFO L87 Difference]: Start difference. First operand 796 states and 1054 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:05,403 INFO L93 Difference]: Finished difference Result 2454 states and 3298 transitions. [2023-11-19 08:01:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:01:05,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2023-11-19 08:01:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:05,415 INFO L225 Difference]: With dead ends: 2454 [2023-11-19 08:01:05,415 INFO L226 Difference]: Without dead ends: 1669 [2023-11-19 08:01:05,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-19 08:01:05,419 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 420 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:05,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 380 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:01:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2023-11-19 08:01:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1495. [2023-11-19 08:01:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1225 states have (on average 1.3273469387755101) internal successors, (1626), 1242 states have internal predecessors, (1626), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2023-11-19 08:01:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1985 transitions. [2023-11-19 08:01:05,540 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1985 transitions. Word has length 56 [2023-11-19 08:01:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:05,541 INFO L495 AbstractCegarLoop]: Abstraction has 1495 states and 1985 transitions. [2023-11-19 08:01:05,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1985 transitions. [2023-11-19 08:01:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 08:01:05,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:05,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:01:05,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:01:05,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:05,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1414703249, now seen corresponding path program 1 times [2023-11-19 08:01:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302121195] [2023-11-19 08:01:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:05,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:05,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:05,596 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-19 08:01:05,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:05,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302121195] [2023-11-19 08:01:05,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302121195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:05,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:05,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:01:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682332982] [2023-11-19 08:01:05,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:05,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:01:05,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:01:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:01:05,599 INFO L87 Difference]: Start difference. First operand 1495 states and 1985 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:05,892 INFO L93 Difference]: Finished difference Result 2879 states and 3805 transitions. [2023-11-19 08:01:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:05,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 08:01:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:05,900 INFO L225 Difference]: With dead ends: 2879 [2023-11-19 08:01:05,901 INFO L226 Difference]: Without dead ends: 1395 [2023-11-19 08:01:05,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:05,905 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 277 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:05,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 247 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 08:01:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2023-11-19 08:01:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1218. [2023-11-19 08:01:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1004 states have (on average 1.3197211155378485) internal successors, (1325), 1019 states have internal predecessors, (1325), 122 states have call successors, (122), 78 states have call predecessors, (122), 88 states have return successors, (152), 121 states have call predecessors, (152), 122 states have call successors, (152) [2023-11-19 08:01:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1599 transitions. [2023-11-19 08:01:05,989 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1599 transitions. Word has length 57 [2023-11-19 08:01:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:05,989 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1599 transitions. [2023-11-19 08:01:05,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 08:01:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1599 transitions. [2023-11-19 08:01:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-19 08:01:05,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:05,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:01:05,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:01:05,991 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:05,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 375464921, now seen corresponding path program 1 times [2023-11-19 08:01:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:05,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825035764] [2023-11-19 08:01:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,074 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-19 08:01:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:06,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825035764] [2023-11-19 08:01:06,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825035764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:06,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:06,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:01:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485012456] [2023-11-19 08:01:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:06,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:01:06,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:06,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:01:06,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:01:06,077 INFO L87 Difference]: Start difference. First operand 1218 states and 1599 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 08:01:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:06,547 INFO L93 Difference]: Finished difference Result 3492 states and 4608 transitions. [2023-11-19 08:01:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:01:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2023-11-19 08:01:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:06,566 INFO L225 Difference]: With dead ends: 3492 [2023-11-19 08:01:06,567 INFO L226 Difference]: Without dead ends: 2284 [2023-11-19 08:01:06,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:01:06,572 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 329 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:06,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 394 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:01:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2023-11-19 08:01:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 1992. [2023-11-19 08:01:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1640 states have (on average 1.302439024390244) internal successors, (2136), 1664 states have internal predecessors, (2136), 200 states have call successors, (200), 132 states have call predecessors, (200), 148 states have return successors, (249), 196 states have call predecessors, (249), 200 states have call successors, (249) [2023-11-19 08:01:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2585 transitions. [2023-11-19 08:01:06,737 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2585 transitions. Word has length 58 [2023-11-19 08:01:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:06,738 INFO L495 AbstractCegarLoop]: Abstraction has 1992 states and 2585 transitions. [2023-11-19 08:01:06,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 08:01:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2585 transitions. [2023-11-19 08:01:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 08:01:06,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:06,740 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 08:01:06,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:01:06,741 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:06,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash -163397292, now seen corresponding path program 1 times [2023-11-19 08:01:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:06,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918083424] [2023-11-19 08:01:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:06,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:01:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 08:01:06,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:06,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918083424] [2023-11-19 08:01:06,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918083424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:06,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:06,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:01:06,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995330164] [2023-11-19 08:01:06,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:06,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:01:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:01:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:01:06,839 INFO L87 Difference]: Start difference. First operand 1992 states and 2585 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 08:01:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:07,940 INFO L93 Difference]: Finished difference Result 6324 states and 8267 transitions. [2023-11-19 08:01:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 08:01:07,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 77 [2023-11-19 08:01:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:07,969 INFO L225 Difference]: With dead ends: 6324 [2023-11-19 08:01:07,969 INFO L226 Difference]: Without dead ends: 4343 [2023-11-19 08:01:07,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-19 08:01:07,976 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 700 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:07,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 546 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 08:01:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2023-11-19 08:01:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 3908. [2023-11-19 08:01:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3206 states have (on average 1.2844666250779788) internal successors, (4118), 3267 states have internal predecessors, (4118), 384 states have call successors, (384), 258 states have call predecessors, (384), 314 states have return successors, (586), 384 states have call predecessors, (586), 384 states have call successors, (586) [2023-11-19 08:01:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5088 transitions. [2023-11-19 08:01:08,277 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5088 transitions. Word has length 77 [2023-11-19 08:01:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:08,278 INFO L495 AbstractCegarLoop]: Abstraction has 3908 states and 5088 transitions. [2023-11-19 08:01:08,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 08:01:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5088 transitions. [2023-11-19 08:01:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-19 08:01:08,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:08,281 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 08:01:08,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:01:08,282 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:08,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash 654619595, now seen corresponding path program 1 times [2023-11-19 08:01:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:08,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630369277] [2023-11-19 08:01:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 08:01:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 08:01:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:01:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-19 08:01:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630369277] [2023-11-19 08:01:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630369277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:08,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:01:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278899596] [2023-11-19 08:01:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:08,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:01:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:01:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:01:08,499 INFO L87 Difference]: Start difference. First operand 3908 states and 5088 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 08:01:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:09,167 INFO L93 Difference]: Finished difference Result 7528 states and 9761 transitions. [2023-11-19 08:01:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:01:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2023-11-19 08:01:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:09,202 INFO L225 Difference]: With dead ends: 7528 [2023-11-19 08:01:09,202 INFO L226 Difference]: Without dead ends: 4409 [2023-11-19 08:01:09,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-11-19 08:01:09,212 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 536 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:09,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 362 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:01:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2023-11-19 08:01:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 3876. [2023-11-19 08:01:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3170 states have (on average 1.2750788643533124) internal successors, (4042), 3235 states have internal predecessors, (4042), 384 states have call successors, (384), 258 states have call predecessors, (384), 318 states have return successors, (531), 384 states have call predecessors, (531), 384 states have call successors, (531) [2023-11-19 08:01:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 4957 transitions. [2023-11-19 08:01:09,553 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 4957 transitions. Word has length 91 [2023-11-19 08:01:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:09,554 INFO L495 AbstractCegarLoop]: Abstraction has 3876 states and 4957 transitions. [2023-11-19 08:01:09,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 08:01:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 4957 transitions. [2023-11-19 08:01:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-19 08:01:09,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:09,576 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 08:01:09,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 08:01:09,577 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:09,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1979475789, now seen corresponding path program 1 times [2023-11-19 08:01:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:09,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22604847] [2023-11-19 08:01:09,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 08:01:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 08:01:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:01:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-19 08:01:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22604847] [2023-11-19 08:01:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22604847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:01:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780590488] [2023-11-19 08:01:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:09,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:01:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:01:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:01:09,673 INFO L87 Difference]: Start difference. First operand 3876 states and 4957 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 08:01:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:10,159 INFO L93 Difference]: Finished difference Result 4271 states and 5475 transitions. [2023-11-19 08:01:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:10,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2023-11-19 08:01:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:10,198 INFO L225 Difference]: With dead ends: 4271 [2023-11-19 08:01:10,198 INFO L226 Difference]: Without dead ends: 3518 [2023-11-19 08:01:10,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:10,203 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 275 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:10,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 242 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 08:01:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2023-11-19 08:01:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3125. [2023-11-19 08:01:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2560 states have (on average 1.280078125) internal successors, (3277), 2615 states have internal predecessors, (3277), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431) [2023-11-19 08:01:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4011 transitions. [2023-11-19 08:01:10,507 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4011 transitions. Word has length 91 [2023-11-19 08:01:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:10,507 INFO L495 AbstractCegarLoop]: Abstraction has 3125 states and 4011 transitions. [2023-11-19 08:01:10,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 08:01:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4011 transitions. [2023-11-19 08:01:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 08:01:10,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:10,513 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 08:01:10,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 08:01:10,514 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:10,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1024919005, now seen corresponding path program 1 times [2023-11-19 08:01:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:10,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463425238] [2023-11-19 08:01:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 08:01:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 08:01:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 08:01:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 08:01:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463425238] [2023-11-19 08:01:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463425238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:10,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:10,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:01:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815355951] [2023-11-19 08:01:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:10,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:01:10,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:10,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:01:10,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:01:10,651 INFO L87 Difference]: Start difference. First operand 3125 states and 4011 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 08:01:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:11,895 INFO L93 Difference]: Finished difference Result 5468 states and 7103 transitions. [2023-11-19 08:01:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 08:01:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2023-11-19 08:01:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:11,911 INFO L225 Difference]: With dead ends: 5468 [2023-11-19 08:01:11,912 INFO L226 Difference]: Without dead ends: 3435 [2023-11-19 08:01:11,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2023-11-19 08:01:11,918 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1051 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:11,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 615 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 08:01:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2023-11-19 08:01:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3125. [2023-11-19 08:01:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2560 states have (on average 1.271484375) internal successors, (3255), 2615 states have internal predecessors, (3255), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2023-11-19 08:01:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 3956 transitions. [2023-11-19 08:01:12,144 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 3956 transitions. Word has length 93 [2023-11-19 08:01:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:12,144 INFO L495 AbstractCegarLoop]: Abstraction has 3125 states and 3956 transitions. [2023-11-19 08:01:12,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 08:01:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 3956 transitions. [2023-11-19 08:01:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-19 08:01:12,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:12,147 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 08:01:12,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 08:01:12,147 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:12,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1670091637, now seen corresponding path program 1 times [2023-11-19 08:01:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409634123] [2023-11-19 08:01:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:12,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 08:01:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 08:01:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 08:01:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 08:01:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 08:01:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 08:01:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-19 08:01:12,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:12,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409634123] [2023-11-19 08:01:12,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409634123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:12,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:12,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:01:12,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448512114] [2023-11-19 08:01:12,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:12,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:01:12,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:12,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:01:12,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:01:12,235 INFO L87 Difference]: Start difference. First operand 3125 states and 3956 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 08:01:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:12,630 INFO L93 Difference]: Finished difference Result 3518 states and 4474 transitions. [2023-11-19 08:01:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:01:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 100 [2023-11-19 08:01:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:12,653 INFO L225 Difference]: With dead ends: 3518 [2023-11-19 08:01:12,653 INFO L226 Difference]: Without dead ends: 3517 [2023-11-19 08:01:12,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:01:12,656 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 269 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:12,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 230 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 08:01:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2023-11-19 08:01:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3124. [2023-11-19 08:01:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 2560 states have (on average 1.26796875) internal successors, (3246), 2614 states have internal predecessors, (3246), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2023-11-19 08:01:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 3947 transitions. [2023-11-19 08:01:12,907 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 3947 transitions. Word has length 100 [2023-11-19 08:01:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:12,907 INFO L495 AbstractCegarLoop]: Abstraction has 3124 states and 3947 transitions. [2023-11-19 08:01:12,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 08:01:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 3947 transitions. [2023-11-19 08:01:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-19 08:01:12,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:12,909 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 08:01:12,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 08:01:12,910 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 08:01:12,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash 233233506, now seen corresponding path program 1 times [2023-11-19 08:01:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556344575] [2023-11-19 08:01:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:01:12,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:01:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:01:12,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:01:12,982 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:01:12,983 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-11-19 08:01:12,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-11-19 08:01:12,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-11-19 08:01:12,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-11-19 08:01:12,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 08:01:12,989 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] [2023-11-19 08:01:12,993 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:01:13,068 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-19 08:01:13,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-19 08:01:13,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:01:13 BoogieIcfgContainer [2023-11-19 08:01:13,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:01:13,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:01:13,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:01:13,116 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:01:13,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:53" (3/4) ... [2023-11-19 08:01:13,117 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 08:01:13,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-19 08:01:13,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-19 08:01:13,228 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:01:13,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:01:13,230 INFO L158 Benchmark]: Toolchain (without parser) took 20510.38ms. Allocated memory was 127.9MB in the beginning and 375.4MB in the end (delta: 247.5MB). Free memory was 82.5MB in the beginning and 252.8MB in the end (delta: -170.3MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2023-11-19 08:01:13,230 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 127.9MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:01:13,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.48ms. Allocated memory is still 127.9MB. Free memory was 82.2MB in the beginning and 69.0MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 08:01:13,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.67ms. Allocated memory is still 127.9MB. Free memory was 69.0MB in the beginning and 67.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:01:13,231 INFO L158 Benchmark]: Boogie Preprocessor took 34.76ms. Allocated memory is still 127.9MB. Free memory was 67.1MB in the beginning and 65.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:01:13,232 INFO L158 Benchmark]: RCFGBuilder took 652.27ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 65.4MB in the beginning and 118.7MB in the end (delta: -53.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2023-11-19 08:01:13,232 INFO L158 Benchmark]: TraceAbstraction took 19169.65ms. Allocated memory was 155.2MB in the beginning and 375.4MB in the end (delta: 220.2MB). Free memory was 117.6MB in the beginning and 259.1MB in the end (delta: -141.5MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2023-11-19 08:01:13,236 INFO L158 Benchmark]: Witness Printer took 113.45ms. Allocated memory is still 375.4MB. Free memory was 259.1MB in the beginning and 252.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 08:01:13,240 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.30ms. Allocated memory is still 127.9MB. Free memory is still 71.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.48ms. Allocated memory is still 127.9MB. Free memory was 82.2MB in the beginning and 69.0MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.67ms. Allocated memory is still 127.9MB. Free memory was 69.0MB in the beginning and 67.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.76ms. Allocated memory is still 127.9MB. Free memory was 67.1MB in the beginning and 65.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 652.27ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 65.4MB in the beginning and 118.7MB in the end (delta: -53.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19169.65ms. Allocated memory was 155.2MB in the beginning and 375.4MB in the end (delta: 220.2MB). Free memory was 117.6MB in the beginning and 259.1MB in the end (delta: -141.5MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. * Witness Printer took 113.45ms. Allocated memory is still 375.4MB. Free memory was 259.1MB in the beginning and 252.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 119]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L232-L243] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE, EXPR \read(tmp_ndt_2) [L251] EXPR t1_st = 1 [L252] CALL, EXPR transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET, EXPR transmit1() [L246-L257] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE, EXPR \read(tmp_ndt_1) [L237] EXPR m_st = 1 [L238] CALL, EXPR master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L353] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L146] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L148] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=2147483647] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L167] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=2147483647] [L353] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L238] RET, EXPR master() [L232-L243] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=2147483647] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L119] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 124 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7269 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7086 mSDsluCounter, 9096 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6658 mSDsCounter, 1317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7652 IncrementalHoareTripleChecker+Invalid, 8969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1317 mSolverCounterUnsat, 2438 mSDtfsCounter, 7652 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3908occurred in iteration=14, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 4363 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 121/121 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-19 08:01:13,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f41e38d1-7c03-4a54-889f-f3d986b4ca8f/bin/uautomizer-verify-uCwYo4JHxu/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)