./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:23:05,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:23:05,314 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:23:05,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:23:05,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:23:05,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:23:05,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:23:05,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:23:05,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:23:05,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:23:05,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:23:05,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:23:05,354 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:23:05,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:23:05,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:23:05,356 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:23:05,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:23:05,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:23:05,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:23:05,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:23:05,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:23:05,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:23:05,360 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:23:05,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:23:05,361 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:23:05,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:23:05,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:23:05,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:23:05,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:05,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:23:05,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:23:05,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:23:05,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:23:05,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:23:05,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:23:05,367 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:23:05,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:23:05,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:23:05,368 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:23:05,369 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_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/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_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! call(reach_error())) ) 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2023-11-06 22:23:05,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:23:05,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:23:05,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:23:05,765 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:23:05,765 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:23:05,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-11-06 22:23:08,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:23:09,213 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:23:09,216 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-11-06 22:23:09,238 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/data/9d01b6884/a4c3035f8d6646f2b93f030b96fd04c0/FLAGc265d8105 [2023-11-06 22:23:09,260 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/data/9d01b6884/a4c3035f8d6646f2b93f030b96fd04c0 [2023-11-06 22:23:09,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:23:09,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:23:09,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:09,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:23:09,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:23:09,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0d5b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09, skipping insertion in model container [2023-11-06 22:23:09,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,366 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:23:09,591 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2023-11-06 22:23:09,694 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2023-11-06 22:23:09,774 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:09,798 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:23:09,819 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2023-11-06 22:23:09,840 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2023-11-06 22:23:09,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:09,883 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:23:09,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09 WrapperNode [2023-11-06 22:23:09,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:09,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:09,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:23:09,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:23:09,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,983 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 416 [2023-11-06 22:23:09,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:09,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:23:09,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:23:09,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:23:09,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:10,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:10,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:10,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:10,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:10,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:10,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:10,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:23:10,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:23:10,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:23:10,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:23:10,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:10,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:10,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:23:10,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:23:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:23:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-06 22:23:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-06 22:23:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-06 22:23:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-06 22:23:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-06 22:23:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-06 22:23:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-06 22:23:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-06 22:23:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-06 22:23:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-06 22:23:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-06 22:23:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-06 22:23:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-06 22:23:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-06 22:23:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-06 22:23:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-06 22:23:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-06 22:23:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-06 22:23:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-06 22:23:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-06 22:23:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-06 22:23:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-06 22:23:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:23:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-06 22:23:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-06 22:23:10,147 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-06 22:23:10,147 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-06 22:23:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:23:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:23:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-06 22:23:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-06 22:23:10,149 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-11-06 22:23:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-11-06 22:23:10,300 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:23:10,304 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:23:10,911 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:23:10,923 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:23:10,924 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-06 22:23:10,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:10 BoogieIcfgContainer [2023-11-06 22:23:10,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:23:10,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:23:10,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:23:10,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:23:10,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:09" (1/3) ... [2023-11-06 22:23:10,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111f862c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:10, skipping insertion in model container [2023-11-06 22:23:10,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (2/3) ... [2023-11-06 22:23:10,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111f862c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:10, skipping insertion in model container [2023-11-06 22:23:10,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:10" (3/3) ... [2023-11-06 22:23:10,939 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2023-11-06 22:23:10,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:23:10,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:23:11,033 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:23:11,042 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=LoopsAndPotentialCycles, 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;@981825e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:23:11,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-06 22:23:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 177 states have internal predecessors, (260), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 22:23:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:23:11,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:11,067 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-06 22:23:11,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:11,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1543295368, now seen corresponding path program 1 times [2023-11-06 22:23:11,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289976624] [2023-11-06 22:23:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:23:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:23:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:23:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,709 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-06 22:23:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:11,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289976624] [2023-11-06 22:23:11,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289976624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:11,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:11,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590170339] [2023-11-06 22:23:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:11,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:11,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:11,773 INFO L87 Difference]: Start difference. First operand has 218 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 177 states have internal predecessors, (260), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:13,094 INFO L93 Difference]: Finished difference Result 558 states and 838 transitions. [2023-11-06 22:23:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:23:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2023-11-06 22:23:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:13,128 INFO L225 Difference]: With dead ends: 558 [2023-11-06 22:23:13,128 INFO L226 Difference]: Without dead ends: 347 [2023-11-06 22:23:13,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:23:13,143 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 542 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:13,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 687 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:23:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-06 22:23:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 304. [2023-11-06 22:23:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 241 states have (on average 1.4481327800829875) internal successors, (349), 247 states have internal predecessors, (349), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2023-11-06 22:23:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2023-11-06 22:23:13,292 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 58 [2023-11-06 22:23:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:13,293 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2023-11-06 22:23:13,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2023-11-06 22:23:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:23:13,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:13,308 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-06 22:23:13,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:23:13,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:13,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash -957412732, now seen corresponding path program 1 times [2023-11-06 22:23:13,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:13,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692927038] [2023-11-06 22:23:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:23:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:13,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:23:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:23:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:13,630 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-06 22:23:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692927038] [2023-11-06 22:23:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692927038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:13,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:13,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:23:13,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954042401] [2023-11-06 22:23:13,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:13,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:13,636 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:14,736 INFO L93 Difference]: Finished difference Result 661 states and 944 transitions. [2023-11-06 22:23:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:23:14,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2023-11-06 22:23:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:14,752 INFO L225 Difference]: With dead ends: 661 [2023-11-06 22:23:14,753 INFO L226 Difference]: Without dead ends: 462 [2023-11-06 22:23:14,762 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-06 22:23:14,766 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 521 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:14,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1037 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:23:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-11-06 22:23:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 396. [2023-11-06 22:23:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 316 states have (on average 1.4430379746835442) internal successors, (456), 323 states have internal predecessors, (456), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2023-11-06 22:23:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 559 transitions. [2023-11-06 22:23:14,863 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 559 transitions. Word has length 58 [2023-11-06 22:23:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:14,869 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 559 transitions. [2023-11-06 22:23:14,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 559 transitions. [2023-11-06 22:23:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:23:14,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:14,875 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-06 22:23:14,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:23:14,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:14,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash -63926394, now seen corresponding path program 1 times [2023-11-06 22:23:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573948177] [2023-11-06 22:23:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:23:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:23:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:23:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,081 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-06 22:23:15,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:15,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573948177] [2023-11-06 22:23:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573948177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:15,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:15,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:23:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396873369] [2023-11-06 22:23:15,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:15,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:15,085 INFO L87 Difference]: Start difference. First operand 396 states and 559 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:16,210 INFO L93 Difference]: Finished difference Result 1018 states and 1447 transitions. [2023-11-06 22:23:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:23:16,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2023-11-06 22:23:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:16,219 INFO L225 Difference]: With dead ends: 1018 [2023-11-06 22:23:16,219 INFO L226 Difference]: Without dead ends: 727 [2023-11-06 22:23:16,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:23:16,222 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 535 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:16,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1025 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:23:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2023-11-06 22:23:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 575. [2023-11-06 22:23:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 463 states have (on average 1.4406047516198703) internal successors, (667), 472 states have internal predecessors, (667), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2023-11-06 22:23:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 814 transitions. [2023-11-06 22:23:16,301 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 814 transitions. Word has length 58 [2023-11-06 22:23:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:16,302 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 814 transitions. [2023-11-06 22:23:16,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 814 transitions. [2023-11-06 22:23:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:23:16,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:16,304 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-06 22:23:16,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:23:16,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:16,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2113314236, now seen corresponding path program 1 times [2023-11-06 22:23:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:16,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665273921] [2023-11-06 22:23:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:16,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:23:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:23:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:16,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:23:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:16,420 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-06 22:23:16,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:16,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665273921] [2023-11-06 22:23:16,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665273921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:16,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:16,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:23:16,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136493198] [2023-11-06 22:23:16,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:16,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:16,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:16,423 INFO L87 Difference]: Start difference. First operand 575 states and 814 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:17,189 INFO L93 Difference]: Finished difference Result 1202 states and 1736 transitions. [2023-11-06 22:23:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:23:17,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2023-11-06 22:23:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:17,196 INFO L225 Difference]: With dead ends: 1202 [2023-11-06 22:23:17,196 INFO L226 Difference]: Without dead ends: 733 [2023-11-06 22:23:17,198 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-06 22:23:17,200 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 262 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:17,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 908 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:23:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2023-11-06 22:23:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 590. [2023-11-06 22:23:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 478 states have (on average 1.4267782426778242) internal successors, (682), 487 states have internal predecessors, (682), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2023-11-06 22:23:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 829 transitions. [2023-11-06 22:23:17,321 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 829 transitions. Word has length 58 [2023-11-06 22:23:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:17,323 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 829 transitions. [2023-11-06 22:23:17,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 829 transitions. [2023-11-06 22:23:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:23:17,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:17,327 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-06 22:23:17,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:23:17,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:17,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -62330238, now seen corresponding path program 1 times [2023-11-06 22:23:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:17,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101131083] [2023-11-06 22:23:17,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:17,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:23:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:23:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:17,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:23:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:17,514 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-06 22:23:17,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:17,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101131083] [2023-11-06 22:23:17,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101131083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:17,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:17,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:23:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501759465] [2023-11-06 22:23:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:17,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:17,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:17,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:17,518 INFO L87 Difference]: Start difference. First operand 590 states and 829 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:18,928 INFO L93 Difference]: Finished difference Result 2518 states and 3648 transitions. [2023-11-06 22:23:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:23:18,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2023-11-06 22:23:18,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:18,945 INFO L225 Difference]: With dead ends: 2518 [2023-11-06 22:23:18,945 INFO L226 Difference]: Without dead ends: 2034 [2023-11-06 22:23:18,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:23:18,951 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1064 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:18,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 831 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:23:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2023-11-06 22:23:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1779. [2023-11-06 22:23:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1424 states have (on average 1.375) internal successors, (1958), 1460 states have internal predecessors, (1958), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2023-11-06 22:23:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2471 transitions. [2023-11-06 22:23:19,200 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2471 transitions. Word has length 58 [2023-11-06 22:23:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:19,201 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2471 transitions. [2023-11-06 22:23:19,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:23:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2471 transitions. [2023-11-06 22:23:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:23:19,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:19,204 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:19,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:23:19,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:19,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1865041758, now seen corresponding path program 1 times [2023-11-06 22:23:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:19,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953995813] [2023-11-06 22:23:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,399 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-06 22:23:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:19,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953995813] [2023-11-06 22:23:19,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953995813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:19,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:23:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133280522] [2023-11-06 22:23:19,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:19,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:23:19,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:23:19,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:23:19,403 INFO L87 Difference]: Start difference. First operand 1779 states and 2471 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:23:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:20,332 INFO L93 Difference]: Finished difference Result 2002 states and 2786 transitions. [2023-11-06 22:23:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:23:20,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-06 22:23:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:20,347 INFO L225 Difference]: With dead ends: 2002 [2023-11-06 22:23:20,347 INFO L226 Difference]: Without dead ends: 1914 [2023-11-06 22:23:20,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:23:20,353 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 417 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:20,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 857 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:23:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2023-11-06 22:23:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1875. [2023-11-06 22:23:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1500 states have (on average 1.3753333333333333) internal successors, (2063), 1538 states have internal predecessors, (2063), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2023-11-06 22:23:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2603 transitions. [2023-11-06 22:23:20,634 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2603 transitions. Word has length 65 [2023-11-06 22:23:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:20,635 INFO L495 AbstractCegarLoop]: Abstraction has 1875 states and 2603 transitions. [2023-11-06 22:23:20,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:23:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2603 transitions. [2023-11-06 22:23:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:23:20,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:20,638 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:20,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:23:20,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:20,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash -751036898, now seen corresponding path program 1 times [2023-11-06 22:23:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:20,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772866835] [2023-11-06 22:23:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,816 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-06 22:23:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772866835] [2023-11-06 22:23:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772866835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:20,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:23:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139715794] [2023-11-06 22:23:20,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:20,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:23:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:20,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:23:20,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:23:20,819 INFO L87 Difference]: Start difference. First operand 1875 states and 2603 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:23:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:21,998 INFO L93 Difference]: Finished difference Result 2222 states and 3080 transitions. [2023-11-06 22:23:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:23:21,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-06 22:23:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:22,013 INFO L225 Difference]: With dead ends: 2222 [2023-11-06 22:23:22,013 INFO L226 Difference]: Without dead ends: 2045 [2023-11-06 22:23:22,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:23:22,017 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 690 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:22,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 980 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:23:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2023-11-06 22:23:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1971. [2023-11-06 22:23:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1576 states have (on average 1.375) internal successors, (2167), 1616 states have internal predecessors, (2167), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2023-11-06 22:23:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2737 transitions. [2023-11-06 22:23:22,324 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2737 transitions. Word has length 65 [2023-11-06 22:23:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:22,325 INFO L495 AbstractCegarLoop]: Abstraction has 1971 states and 2737 transitions. [2023-11-06 22:23:22,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:23:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2737 transitions. [2023-11-06 22:23:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:23:22,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:22,329 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:22,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:23:22,329 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:22,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1515344288, now seen corresponding path program 1 times [2023-11-06 22:23:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:22,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869255946] [2023-11-06 22:23:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,478 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-06 22:23:22,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:22,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869255946] [2023-11-06 22:23:22,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869255946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:22,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:22,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:23:22,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229357887] [2023-11-06 22:23:22,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:22,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:23:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:23:22,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:23:22,481 INFO L87 Difference]: Start difference. First operand 1971 states and 2737 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:23:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:23,517 INFO L93 Difference]: Finished difference Result 2272 states and 3151 transitions. [2023-11-06 22:23:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:23:23,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-06 22:23:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:23,533 INFO L225 Difference]: With dead ends: 2272 [2023-11-06 22:23:23,533 INFO L226 Difference]: Without dead ends: 2005 [2023-11-06 22:23:23,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:23:23,536 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 218 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:23,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1206 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:23:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2023-11-06 22:23:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1976. [2023-11-06 22:23:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1580 states have (on average 1.3727848101265823) internal successors, (2169), 1620 states have internal predecessors, (2169), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2023-11-06 22:23:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2740 transitions. [2023-11-06 22:23:23,798 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2740 transitions. Word has length 65 [2023-11-06 22:23:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:23,799 INFO L495 AbstractCegarLoop]: Abstraction has 1976 states and 2740 transitions. [2023-11-06 22:23:23,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:23:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2740 transitions. [2023-11-06 22:23:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:23:23,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:23,802 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:23,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:23:23,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:23,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash 485984990, now seen corresponding path program 1 times [2023-11-06 22:23:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754569852] [2023-11-06 22:23:23,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:23,959 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-06 22:23:23,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:23,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754569852] [2023-11-06 22:23:23,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754569852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:23,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:23,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:23:23,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578991461] [2023-11-06 22:23:23,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:23,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:23:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:23,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:23:23,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:23:23,975 INFO L87 Difference]: Start difference. First operand 1976 states and 2740 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 22:23:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:26,228 INFO L93 Difference]: Finished difference Result 3638 states and 5012 transitions. [2023-11-06 22:23:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:23:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-06 22:23:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:26,252 INFO L225 Difference]: With dead ends: 3638 [2023-11-06 22:23:26,253 INFO L226 Difference]: Without dead ends: 3366 [2023-11-06 22:23:26,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 22:23:26,257 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 1518 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:26,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 1205 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:23:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3366 states. [2023-11-06 22:23:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3366 to 3116. [2023-11-06 22:23:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3116 states, 2480 states have (on average 1.3508064516129032) internal successors, (3350), 2540 states have internal predecessors, (3350), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2023-11-06 22:23:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4224 transitions. [2023-11-06 22:23:26,738 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4224 transitions. Word has length 65 [2023-11-06 22:23:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:26,739 INFO L495 AbstractCegarLoop]: Abstraction has 3116 states and 4224 transitions. [2023-11-06 22:23:26,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-06 22:23:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4224 transitions. [2023-11-06 22:23:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:23:26,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:26,743 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:26,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:23:26,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:26,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1537434079, now seen corresponding path program 1 times [2023-11-06 22:23:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260892001] [2023-11-06 22:23:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,913 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-06 22:23:26,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:26,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260892001] [2023-11-06 22:23:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260892001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:26,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:23:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247499661] [2023-11-06 22:23:26,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:26,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:23:26,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:26,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:23:26,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:23:26,917 INFO L87 Difference]: Start difference. First operand 3116 states and 4224 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:23:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:28,083 INFO L93 Difference]: Finished difference Result 4717 states and 6348 transitions. [2023-11-06 22:23:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:23:28,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-06 22:23:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:28,108 INFO L225 Difference]: With dead ends: 4717 [2023-11-06 22:23:28,108 INFO L226 Difference]: Without dead ends: 3305 [2023-11-06 22:23:28,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:23:28,114 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 216 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:28,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1205 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:23:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2023-11-06 22:23:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3161. [2023-11-06 22:23:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 2516 states have (on average 1.3422098569157392) internal successors, (3377), 2576 states have internal predecessors, (3377), 349 states have call successors, (349), 245 states have call predecessors, (349), 294 states have return successors, (537), 346 states have call predecessors, (537), 345 states have call successors, (537) [2023-11-06 22:23:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4263 transitions. [2023-11-06 22:23:28,707 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4263 transitions. Word has length 65 [2023-11-06 22:23:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:28,708 INFO L495 AbstractCegarLoop]: Abstraction has 3161 states and 4263 transitions. [2023-11-06 22:23:28,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:23:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4263 transitions. [2023-11-06 22:23:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:23:28,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:28,712 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:28,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:23:28,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:28,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1371329823, now seen corresponding path program 1 times [2023-11-06 22:23:28,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:28,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885759463] [2023-11-06 22:23:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:28,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:28,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:28,926 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-06 22:23:28,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:28,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885759463] [2023-11-06 22:23:28,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885759463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:28,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:28,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:23:28,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825519944] [2023-11-06 22:23:28,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:28,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:23:28,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:28,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:23:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:23:28,929 INFO L87 Difference]: Start difference. First operand 3161 states and 4263 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:23:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:30,292 INFO L93 Difference]: Finished difference Result 4596 states and 6102 transitions. [2023-11-06 22:23:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:23:30,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-06 22:23:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:30,321 INFO L225 Difference]: With dead ends: 4596 [2023-11-06 22:23:30,321 INFO L226 Difference]: Without dead ends: 3359 [2023-11-06 22:23:30,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:23:30,328 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 706 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:30,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 747 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:23:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2023-11-06 22:23:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3139. [2023-11-06 22:23:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 2502 states have (on average 1.3401278976818545) internal successors, (3353), 2556 states have internal predecessors, (3353), 349 states have call successors, (349), 245 states have call predecessors, (349), 286 states have return successors, (521), 344 states have call predecessors, (521), 345 states have call successors, (521) [2023-11-06 22:23:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 4223 transitions. [2023-11-06 22:23:30,823 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 4223 transitions. Word has length 65 [2023-11-06 22:23:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:30,824 INFO L495 AbstractCegarLoop]: Abstraction has 3139 states and 4223 transitions. [2023-11-06 22:23:30,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:23:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 4223 transitions. [2023-11-06 22:23:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:23:30,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:30,827 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:30,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:23:30,828 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:30,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1505343329, now seen corresponding path program 1 times [2023-11-06 22:23:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:30,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559653523] [2023-11-06 22:23:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:30,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:30,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:30,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:30,946 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-06 22:23:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:30,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559653523] [2023-11-06 22:23:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559653523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:30,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:23:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476603255] [2023-11-06 22:23:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:30,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:30,950 INFO L87 Difference]: Start difference. First operand 3139 states and 4223 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:23:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:32,160 INFO L93 Difference]: Finished difference Result 6214 states and 8202 transitions. [2023-11-06 22:23:32,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:23:32,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-06 22:23:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:32,196 INFO L225 Difference]: With dead ends: 6214 [2023-11-06 22:23:32,197 INFO L226 Difference]: Without dead ends: 4782 [2023-11-06 22:23:32,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:23:32,204 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 542 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:32,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 732 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:23:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2023-11-06 22:23:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4510. [2023-11-06 22:23:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 3568 states have (on average 1.3088565022421526) internal successors, (4670), 3643 states have internal predecessors, (4670), 501 states have call successors, (501), 368 states have call predecessors, (501), 439 states have return successors, (793), 508 states have call predecessors, (793), 497 states have call successors, (793) [2023-11-06 22:23:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5964 transitions. [2023-11-06 22:23:33,102 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5964 transitions. Word has length 65 [2023-11-06 22:23:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:33,103 INFO L495 AbstractCegarLoop]: Abstraction has 4510 states and 5964 transitions. [2023-11-06 22:23:33,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:23:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5964 transitions. [2023-11-06 22:23:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:23:33,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:33,107 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:33,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:23:33,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:33,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1262306604, now seen corresponding path program 1 times [2023-11-06 22:23:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510215248] [2023-11-06 22:23:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:33,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:33,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:33,213 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-06 22:23:33,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:33,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510215248] [2023-11-06 22:23:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510215248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:33,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680640694] [2023-11-06 22:23:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:33,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:33,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:33,216 INFO L87 Difference]: Start difference. First operand 4510 states and 5964 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:23:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:34,555 INFO L93 Difference]: Finished difference Result 9528 states and 12478 transitions. [2023-11-06 22:23:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:23:34,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2023-11-06 22:23:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:34,602 INFO L225 Difference]: With dead ends: 9528 [2023-11-06 22:23:34,602 INFO L226 Difference]: Without dead ends: 6704 [2023-11-06 22:23:34,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:23:34,614 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 525 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:34,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 595 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:23:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6704 states. [2023-11-06 22:23:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6704 to 6188. [2023-11-06 22:23:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6188 states, 4853 states have (on average 1.2919843395837627) internal successors, (6270), 4935 states have internal predecessors, (6270), 695 states have call successors, (695), 542 states have call predecessors, (695), 638 states have return successors, (1114), 720 states have call predecessors, (1114), 691 states have call successors, (1114) [2023-11-06 22:23:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 8079 transitions. [2023-11-06 22:23:35,555 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 8079 transitions. Word has length 66 [2023-11-06 22:23:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:35,556 INFO L495 AbstractCegarLoop]: Abstraction has 6188 states and 8079 transitions. [2023-11-06 22:23:35,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:23:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 8079 transitions. [2023-11-06 22:23:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:23:35,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:35,562 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:35,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:23:35,563 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:35,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:35,563 INFO L85 PathProgramCache]: Analyzing trace with hash 810620221, now seen corresponding path program 1 times [2023-11-06 22:23:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877022671] [2023-11-06 22:23:35,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:35,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:35,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:35,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:35,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:35,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:35,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877022671] [2023-11-06 22:23:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877022671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:35,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:35,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:23:35,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390881729] [2023-11-06 22:23:35,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:35,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:35,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:35,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:35,697 INFO L87 Difference]: Start difference. First operand 6188 states and 8079 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:23:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:37,511 INFO L93 Difference]: Finished difference Result 7818 states and 10081 transitions. [2023-11-06 22:23:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:23:37,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2023-11-06 22:23:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:37,557 INFO L225 Difference]: With dead ends: 7818 [2023-11-06 22:23:37,557 INFO L226 Difference]: Without dead ends: 7815 [2023-11-06 22:23:37,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:23:37,562 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 964 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:37,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 493 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:23:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7815 states. [2023-11-06 22:23:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7815 to 7242. [2023-11-06 22:23:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 5656 states have (on average 1.28005657708628) internal successors, (7240), 5747 states have internal predecessors, (7240), 821 states have call successors, (821), 656 states have call predecessors, (821), 763 states have return successors, (1307), 848 states have call predecessors, (1307), 818 states have call successors, (1307) [2023-11-06 22:23:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 9368 transitions. [2023-11-06 22:23:38,668 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 9368 transitions. Word has length 73 [2023-11-06 22:23:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:38,668 INFO L495 AbstractCegarLoop]: Abstraction has 7242 states and 9368 transitions. [2023-11-06 22:23:38,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:23:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 9368 transitions. [2023-11-06 22:23:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 22:23:38,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:38,673 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:38,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:23:38,674 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:38,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash -641233259, now seen corresponding path program 1 times [2023-11-06 22:23:38,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:38,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195951803] [2023-11-06 22:23:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:38,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:38,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:38,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:38,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195951803] [2023-11-06 22:23:38,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195951803] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:23:38,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654733913] [2023-11-06 22:23:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:38,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:23:38,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:38,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:23:38,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:23:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:39,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:23:39,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:39,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:23:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654733913] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:23:39,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:23:39,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2023-11-06 22:23:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935622122] [2023-11-06 22:23:39,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:23:39,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:23:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:23:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:23:39,407 INFO L87 Difference]: Start difference. First operand 7242 states and 9368 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-06 22:23:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:43,378 INFO L93 Difference]: Finished difference Result 14888 states and 18896 transitions. [2023-11-06 22:23:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:23:43,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2023-11-06 22:23:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:43,438 INFO L225 Difference]: With dead ends: 14888 [2023-11-06 22:23:43,439 INFO L226 Difference]: Without dead ends: 14885 [2023-11-06 22:23:43,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:23:43,446 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 1213 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:43,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1414 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:23:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14885 states. [2023-11-06 22:23:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14885 to 12500. [2023-11-06 22:23:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12500 states, 9748 states have (on average 1.2668239638900287) internal successors, (12349), 9891 states have internal predecessors, (12349), 1387 states have call successors, (1387), 1146 states have call predecessors, (1387), 1363 states have return successors, (2246), 1472 states have call predecessors, (2246), 1384 states have call successors, (2246) [2023-11-06 22:23:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12500 states to 12500 states and 15982 transitions. [2023-11-06 22:23:45,477 INFO L78 Accepts]: Start accepts. Automaton has 12500 states and 15982 transitions. Word has length 74 [2023-11-06 22:23:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:45,478 INFO L495 AbstractCegarLoop]: Abstraction has 12500 states and 15982 transitions. [2023-11-06 22:23:45,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-06 22:23:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 12500 states and 15982 transitions. [2023-11-06 22:23:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 22:23:45,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:45,484 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:23:45,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:45,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:23:45,696 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:45,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash 184477117, now seen corresponding path program 2 times [2023-11-06 22:23:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127007268] [2023-11-06 22:23:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:45,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:45,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:45,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127007268] [2023-11-06 22:23:45,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127007268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:45,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:45,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:45,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449716506] [2023-11-06 22:23:45,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:45,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:45,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:45,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:45,775 INFO L87 Difference]: Start difference. First operand 12500 states and 15982 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:23:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:47,841 INFO L93 Difference]: Finished difference Result 19043 states and 24324 transitions. [2023-11-06 22:23:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:23:47,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2023-11-06 22:23:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:47,879 INFO L225 Difference]: With dead ends: 19043 [2023-11-06 22:23:47,879 INFO L226 Difference]: Without dead ends: 9105 [2023-11-06 22:23:47,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:23:47,907 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 553 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:47,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 566 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:23:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9105 states. [2023-11-06 22:23:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9105 to 8553. [2023-11-06 22:23:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8553 states, 6695 states have (on average 1.253024645257655) internal successors, (8389), 6794 states have internal predecessors, (8389), 954 states have call successors, (954), 770 states have call predecessors, (954), 902 states have return successors, (1465), 998 states have call predecessors, (1465), 951 states have call successors, (1465) [2023-11-06 22:23:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8553 states to 8553 states and 10808 transitions. [2023-11-06 22:23:49,497 INFO L78 Accepts]: Start accepts. Automaton has 8553 states and 10808 transitions. Word has length 77 [2023-11-06 22:23:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:49,497 INFO L495 AbstractCegarLoop]: Abstraction has 8553 states and 10808 transitions. [2023-11-06 22:23:49,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:23:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8553 states and 10808 transitions. [2023-11-06 22:23:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-06 22:23:49,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:49,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:49,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:23:49,504 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:49,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash 877375111, now seen corresponding path program 1 times [2023-11-06 22:23:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:49,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704856539] [2023-11-06 22:23:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:23:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:23:49,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704856539] [2023-11-06 22:23:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704856539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:49,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:23:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660539444] [2023-11-06 22:23:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:49,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:23:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:49,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:23:49,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:23:49,631 INFO L87 Difference]: Start difference. First operand 8553 states and 10808 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:23:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:52,596 INFO L93 Difference]: Finished difference Result 22427 states and 28025 transitions. [2023-11-06 22:23:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:23:52,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2023-11-06 22:23:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:52,656 INFO L225 Difference]: With dead ends: 22427 [2023-11-06 22:23:52,656 INFO L226 Difference]: Without dead ends: 15584 [2023-11-06 22:23:52,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:23:52,678 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 628 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:52,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 985 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:23:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15584 states. [2023-11-06 22:23:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15584 to 14725. [2023-11-06 22:23:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14725 states, 11371 states have (on average 1.2202972473836953) internal successors, (13876), 11576 states have internal predecessors, (13876), 1670 states have call successors, (1670), 1374 states have call predecessors, (1670), 1682 states have return successors, (2868), 1790 states have call predecessors, (2868), 1667 states have call successors, (2868) [2023-11-06 22:23:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14725 states to 14725 states and 18414 transitions. [2023-11-06 22:23:55,019 INFO L78 Accepts]: Start accepts. Automaton has 14725 states and 18414 transitions. Word has length 84 [2023-11-06 22:23:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:55,020 INFO L495 AbstractCegarLoop]: Abstraction has 14725 states and 18414 transitions. [2023-11-06 22:23:55,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:23:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 14725 states and 18414 transitions. [2023-11-06 22:23:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 22:23:55,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:55,031 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:55,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:23:55,031 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:55,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 983012091, now seen corresponding path program 1 times [2023-11-06 22:23:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:55,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169950015] [2023-11-06 22:23:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:23:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:23:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:23:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:23:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:23:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:23:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:23:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:23:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169950015] [2023-11-06 22:23:55,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169950015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:55,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:55,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:23:55,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913698066] [2023-11-06 22:23:55,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:55,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:23:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:23:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:23:55,180 INFO L87 Difference]: Start difference. First operand 14725 states and 18414 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:23:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:58,524 INFO L93 Difference]: Finished difference Result 25599 states and 31733 transitions. [2023-11-06 22:23:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:23:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2023-11-06 22:23:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:58,578 INFO L225 Difference]: With dead ends: 25599 [2023-11-06 22:23:58,578 INFO L226 Difference]: Without dead ends: 13200 [2023-11-06 22:23:58,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:23:58,613 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 1362 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:58,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 1029 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:23:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13200 states. [2023-11-06 22:24:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13200 to 12300. [2023-11-06 22:24:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12300 states, 9537 states have (on average 1.2149522910768586) internal successors, (11587), 9709 states have internal predecessors, (11587), 1371 states have call successors, (1371), 1123 states have call predecessors, (1371), 1390 states have return successors, (2200), 1480 states have call predecessors, (2200), 1368 states have call successors, (2200) [2023-11-06 22:24:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12300 states to 12300 states and 15158 transitions. [2023-11-06 22:24:00,371 INFO L78 Accepts]: Start accepts. Automaton has 12300 states and 15158 transitions. Word has length 93 [2023-11-06 22:24:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:00,372 INFO L495 AbstractCegarLoop]: Abstraction has 12300 states and 15158 transitions. [2023-11-06 22:24:00,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:24:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 12300 states and 15158 transitions. [2023-11-06 22:24:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-06 22:24:00,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:00,381 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, 1] [2023-11-06 22:24:00,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:24:00,381 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:00,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:00,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1911713907, now seen corresponding path program 1 times [2023-11-06 22:24:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:00,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214733734] [2023-11-06 22:24:00,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:00,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:24:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:24:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214733734] [2023-11-06 22:24:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214733734] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313435846] [2023-11-06 22:24:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:00,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:00,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:00,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:00,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:24:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:24:00,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:24:00,626 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313435846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:24:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698770381] [2023-11-06 22:24:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:00,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:00,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:00,629 INFO L87 Difference]: Start difference. First operand 12300 states and 15158 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:02,186 INFO L93 Difference]: Finished difference Result 15434 states and 19544 transitions. [2023-11-06 22:24:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:02,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2023-11-06 22:24:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:02,224 INFO L225 Difference]: With dead ends: 15434 [2023-11-06 22:24:02,224 INFO L226 Difference]: Without dead ends: 12703 [2023-11-06 22:24:02,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:02,236 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 115 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:02,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 679 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12703 states. [2023-11-06 22:24:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12703 to 12703. [2023-11-06 22:24:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12703 states, 9866 states have (on average 1.2188323535374013) internal successors, (12025), 10042 states have internal predecessors, (12025), 1413 states have call successors, (1413), 1151 states have call predecessors, (1413), 1422 states have return successors, (2264), 1522 states have call predecessors, (2264), 1410 states have call successors, (2264) [2023-11-06 22:24:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12703 states to 12703 states and 15702 transitions. [2023-11-06 22:24:03,921 INFO L78 Accepts]: Start accepts. Automaton has 12703 states and 15702 transitions. Word has length 94 [2023-11-06 22:24:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:03,921 INFO L495 AbstractCegarLoop]: Abstraction has 12703 states and 15702 transitions. [2023-11-06 22:24:03,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 12703 states and 15702 transitions. [2023-11-06 22:24:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 22:24:03,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:03,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:03,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:04,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:04,141 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:04,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 51873263, now seen corresponding path program 1 times [2023-11-06 22:24:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:04,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551845626] [2023-11-06 22:24:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:24:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:24:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:24:04,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:04,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551845626] [2023-11-06 22:24:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551845626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124652808] [2023-11-06 22:24:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:04,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:04,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:04,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:04,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:24:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:04,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:24:04,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-06 22:24:04,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124652808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:04,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:04,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2023-11-06 22:24:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154577663] [2023-11-06 22:24:04,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:04,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:04,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:04,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:04,521 INFO L87 Difference]: Start difference. First operand 12703 states and 15702 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:24:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:06,096 INFO L93 Difference]: Finished difference Result 15627 states and 19815 transitions. [2023-11-06 22:24:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 121 [2023-11-06 22:24:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:06,149 INFO L225 Difference]: With dead ends: 15627 [2023-11-06 22:24:06,150 INFO L226 Difference]: Without dead ends: 13942 [2023-11-06 22:24:06,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:06,163 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 210 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:06,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 438 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13942 states. [2023-11-06 22:24:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13942 to 13898. [2023-11-06 22:24:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13898 states, 10836 states have (on average 1.2315430047988187) internal successors, (13345), 11029 states have internal predecessors, (13345), 1541 states have call successors, (1541), 1236 states have call predecessors, (1541), 1519 states have return successors, (2444), 1645 states have call predecessors, (2444), 1538 states have call successors, (2444) [2023-11-06 22:24:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13898 states to 13898 states and 17330 transitions. [2023-11-06 22:24:08,385 INFO L78 Accepts]: Start accepts. Automaton has 13898 states and 17330 transitions. Word has length 121 [2023-11-06 22:24:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:08,386 INFO L495 AbstractCegarLoop]: Abstraction has 13898 states and 17330 transitions. [2023-11-06 22:24:08,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:24:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 13898 states and 17330 transitions. [2023-11-06 22:24:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:24:08,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:08,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 22:24:08,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:08,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:08,610 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:08,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1880046950, now seen corresponding path program 1 times [2023-11-06 22:24:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014114830] [2023-11-06 22:24:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:24:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:24:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:24:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:24:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-11-06 22:24:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014114830] [2023-11-06 22:24:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014114830] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584609392] [2023-11-06 22:24:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:08,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:08,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:24:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:08,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:24:08,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:24:08,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584609392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:08,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:08,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:24:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561375070] [2023-11-06 22:24:08,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:08,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:08,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:08,926 INFO L87 Difference]: Start difference. First operand 13898 states and 17330 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:24:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:10,804 INFO L93 Difference]: Finished difference Result 17664 states and 22588 transitions. [2023-11-06 22:24:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:10,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 138 [2023-11-06 22:24:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:10,857 INFO L225 Difference]: With dead ends: 17664 [2023-11-06 22:24:10,858 INFO L226 Difference]: Without dead ends: 14392 [2023-11-06 22:24:10,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:10,870 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 261 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:10,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 309 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14392 states. [2023-11-06 22:24:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14392 to 14282. [2023-11-06 22:24:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14282 states, 11195 states have (on average 1.217597141581063) internal successors, (13631), 11383 states have internal predecessors, (13631), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2023-11-06 22:24:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14282 states to 14282 states and 17594 transitions. [2023-11-06 22:24:13,336 INFO L78 Accepts]: Start accepts. Automaton has 14282 states and 17594 transitions. Word has length 138 [2023-11-06 22:24:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:13,337 INFO L495 AbstractCegarLoop]: Abstraction has 14282 states and 17594 transitions. [2023-11-06 22:24:13,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:24:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 14282 states and 17594 transitions. [2023-11-06 22:24:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:24:13,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:13,352 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 22:24:13,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:13,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:24:13,553 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:13,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:13,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1050633723, now seen corresponding path program 1 times [2023-11-06 22:24:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:13,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907703855] [2023-11-06 22:24:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:13,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:24:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:24:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:24:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:24:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-11-06 22:24:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907703855] [2023-11-06 22:24:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907703855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113868720] [2023-11-06 22:24:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:13,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:13,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:13,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:13,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:24:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:13,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:24:13,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-06 22:24:13,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:13,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113868720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:13,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:13,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:24:13,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834446150] [2023-11-06 22:24:13,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:13,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:13,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:13,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:13,829 INFO L87 Difference]: Start difference. First operand 14282 states and 17594 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:24:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:15,746 INFO L93 Difference]: Finished difference Result 18021 states and 22515 transitions. [2023-11-06 22:24:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 138 [2023-11-06 22:24:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:15,777 INFO L225 Difference]: With dead ends: 18021 [2023-11-06 22:24:15,778 INFO L226 Difference]: Without dead ends: 14367 [2023-11-06 22:24:15,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:15,787 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 250 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:15,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 425 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14367 states. [2023-11-06 22:24:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14367 to 14252. [2023-11-06 22:24:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14252 states, 11165 states have (on average 1.2101209135691895) internal successors, (13511), 11353 states have internal predecessors, (13511), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2023-11-06 22:24:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14252 states to 14252 states and 17474 transitions. [2023-11-06 22:24:17,791 INFO L78 Accepts]: Start accepts. Automaton has 14252 states and 17474 transitions. Word has length 138 [2023-11-06 22:24:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:17,791 INFO L495 AbstractCegarLoop]: Abstraction has 14252 states and 17474 transitions. [2023-11-06 22:24:17,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:24:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14252 states and 17474 transitions. [2023-11-06 22:24:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:24:17,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:17,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 22:24:17,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:18,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:18,013 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:18,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1781117525, now seen corresponding path program 1 times [2023-11-06 22:24:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431949448] [2023-11-06 22:24:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:24:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:24:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:24:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-06 22:24:18,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431949448] [2023-11-06 22:24:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431949448] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062729518] [2023-11-06 22:24:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:18,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:18,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:18,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:18,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:24:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:24:18,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:24:18,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062729518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:18,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:18,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:24:18,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900142934] [2023-11-06 22:24:18,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:18,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:18,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:18,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:18,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:18,293 INFO L87 Difference]: Start difference. First operand 14252 states and 17474 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-06 22:24:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:20,696 INFO L93 Difference]: Finished difference Result 21274 states and 26602 transitions. [2023-11-06 22:24:20,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:20,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2023-11-06 22:24:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:20,747 INFO L225 Difference]: With dead ends: 21274 [2023-11-06 22:24:20,747 INFO L226 Difference]: Without dead ends: 17650 [2023-11-06 22:24:20,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:20,761 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 124 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:20,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 671 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17650 states. [2023-11-06 22:24:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17650 to 17646. [2023-11-06 22:24:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17646 states, 13936 states have (on average 1.2158438576349024) internal successors, (16944), 14172 states have internal predecessors, (16944), 1878 states have call successors, (1878), 1512 states have call predecessors, (1878), 1830 states have return successors, (3061), 1978 states have call predecessors, (3061), 1875 states have call successors, (3061) [2023-11-06 22:24:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17646 states to 17646 states and 21883 transitions. [2023-11-06 22:24:23,280 INFO L78 Accepts]: Start accepts. Automaton has 17646 states and 21883 transitions. Word has length 139 [2023-11-06 22:24:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:23,281 INFO L495 AbstractCegarLoop]: Abstraction has 17646 states and 21883 transitions. [2023-11-06 22:24:23,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-06 22:24:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17646 states and 21883 transitions. [2023-11-06 22:24:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:24:23,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:23,296 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 22:24:23,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:23,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 22:24:23,496 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:23,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1582029198, now seen corresponding path program 1 times [2023-11-06 22:24:23,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:23,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038885867] [2023-11-06 22:24:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:23,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:24:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:24:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:24:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-06 22:24:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038885867] [2023-11-06 22:24:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038885867] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35696359] [2023-11-06 22:24:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:23,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:23,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:24:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:24:23,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:24:23,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35696359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:23,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:23,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:24:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840531597] [2023-11-06 22:24:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:23,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:23,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:23,836 INFO L87 Difference]: Start difference. First operand 17646 states and 21883 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-06 22:24:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:26,537 INFO L93 Difference]: Finished difference Result 20546 states and 25867 transitions. [2023-11-06 22:24:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:26,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 140 [2023-11-06 22:24:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:26,583 INFO L225 Difference]: With dead ends: 20546 [2023-11-06 22:24:26,583 INFO L226 Difference]: Without dead ends: 17062 [2023-11-06 22:24:26,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:26,598 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 88 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:26,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 633 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17062 states. [2023-11-06 22:24:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17062 to 16968. [2023-11-06 22:24:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16968 states, 13391 states have (on average 1.2090956612650288) internal successors, (16191), 13619 states have internal predecessors, (16191), 1806 states have call successors, (1806), 1462 states have call predecessors, (1806), 1769 states have return successors, (2921), 1903 states have call predecessors, (2921), 1803 states have call successors, (2921) [2023-11-06 22:24:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16968 states to 16968 states and 20918 transitions. [2023-11-06 22:24:29,053 INFO L78 Accepts]: Start accepts. Automaton has 16968 states and 20918 transitions. Word has length 140 [2023-11-06 22:24:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:29,054 INFO L495 AbstractCegarLoop]: Abstraction has 16968 states and 20918 transitions. [2023-11-06 22:24:29,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-06 22:24:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 16968 states and 20918 transitions. [2023-11-06 22:24:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:24:29,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:29,073 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:24:29,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 22:24:29,274 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:29,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2089728469, now seen corresponding path program 1 times [2023-11-06 22:24:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057700901] [2023-11-06 22:24:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:24:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:24:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:24:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:24:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:24:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:24:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:24:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:24:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:24:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:24:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:24:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 22:24:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 22:24:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:24:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-06 22:24:29,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:29,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057700901] [2023-11-06 22:24:29,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057700901] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:29,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164693587] [2023-11-06 22:24:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:29,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:29,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:29,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:24:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:24:29,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:24:29,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164693587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:29,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:29,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-06 22:24:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279823239] [2023-11-06 22:24:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:29,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:29,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:29,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:29,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:24:29,609 INFO L87 Difference]: Start difference. First operand 16968 states and 20918 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:24:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:30,963 INFO L93 Difference]: Finished difference Result 22116 states and 27138 transitions. [2023-11-06 22:24:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2023-11-06 22:24:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:30,991 INFO L225 Difference]: With dead ends: 22116 [2023-11-06 22:24:30,991 INFO L226 Difference]: Without dead ends: 11534 [2023-11-06 22:24:31,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:24:31,010 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 34 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:31,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11534 states. [2023-11-06 22:24:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11534 to 11092. [2023-11-06 22:24:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11092 states, 8956 states have (on average 1.2122599374720857) internal successors, (10857), 9082 states have internal predecessors, (10857), 1108 states have call successors, (1108), 856 states have call predecessors, (1108), 1026 states have return successors, (1761), 1161 states have call predecessors, (1761), 1105 states have call successors, (1761) [2023-11-06 22:24:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11092 states to 11092 states and 13726 transitions. [2023-11-06 22:24:32,525 INFO L78 Accepts]: Start accepts. Automaton has 11092 states and 13726 transitions. Word has length 145 [2023-11-06 22:24:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:32,525 INFO L495 AbstractCegarLoop]: Abstraction has 11092 states and 13726 transitions. [2023-11-06 22:24:32,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:24:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 11092 states and 13726 transitions. [2023-11-06 22:24:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-06 22:24:32,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:32,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 22:24:32,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:32,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 22:24:32,739 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:32,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1518844410, now seen corresponding path program 1 times [2023-11-06 22:24:32,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:32,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977021397] [2023-11-06 22:24:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:32,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:24:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:24:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:24:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-06 22:24:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977021397] [2023-11-06 22:24:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977021397] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884184801] [2023-11-06 22:24:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:32,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:32,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:32,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:32,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:24:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:24:32,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-06 22:24:33,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884184801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:33,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-06 22:24:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142980327] [2023-11-06 22:24:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:33,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:33,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:33,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:24:33,089 INFO L87 Difference]: Start difference. First operand 11092 states and 13726 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:34,700 INFO L93 Difference]: Finished difference Result 13760 states and 17238 transitions. [2023-11-06 22:24:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:24:34,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2023-11-06 22:24:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:34,716 INFO L225 Difference]: With dead ends: 13760 [2023-11-06 22:24:34,716 INFO L226 Difference]: Without dead ends: 9826 [2023-11-06 22:24:34,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:24:34,722 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 317 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:34,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 431 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:24:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2023-11-06 22:24:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 9784. [2023-11-06 22:24:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9784 states, 7884 states have (on average 1.191273465246068) internal successors, (9392), 7976 states have internal predecessors, (9392), 990 states have call successors, (990), 766 states have call predecessors, (990), 908 states have return successors, (1500), 1045 states have call predecessors, (1500), 987 states have call successors, (1500) [2023-11-06 22:24:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9784 states to 9784 states and 11882 transitions. [2023-11-06 22:24:35,930 INFO L78 Accepts]: Start accepts. Automaton has 9784 states and 11882 transitions. Word has length 141 [2023-11-06 22:24:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:35,930 INFO L495 AbstractCegarLoop]: Abstraction has 9784 states and 11882 transitions. [2023-11-06 22:24:35,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 9784 states and 11882 transitions. [2023-11-06 22:24:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-06 22:24:35,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:35,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 22:24:35,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-06 22:24:36,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 22:24:36,141 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:36,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2142126012, now seen corresponding path program 1 times [2023-11-06 22:24:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646241307] [2023-11-06 22:24:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:24:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:24:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:24:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-06 22:24:36,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:36,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646241307] [2023-11-06 22:24:36,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646241307] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:36,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574301416] [2023-11-06 22:24:36,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:36,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:36,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:36,255 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:36,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:24:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:24:36,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-06 22:24:36,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574301416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:36,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-11-06 22:24:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109015112] [2023-11-06 22:24:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:24:36,476 INFO L87 Difference]: Start difference. First operand 9784 states and 11882 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:37,927 INFO L93 Difference]: Finished difference Result 12753 states and 15626 transitions. [2023-11-06 22:24:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:37,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2023-11-06 22:24:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:37,942 INFO L225 Difference]: With dead ends: 12753 [2023-11-06 22:24:37,942 INFO L226 Difference]: Without dead ends: 7889 [2023-11-06 22:24:37,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:24:37,952 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 352 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:37,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 424 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:24:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7889 states. [2023-11-06 22:24:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7889 to 6972. [2023-11-06 22:24:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6972 states, 5581 states have (on average 1.164307471779251) internal successors, (6498), 5639 states have internal predecessors, (6498), 704 states have call successors, (704), 557 states have call predecessors, (704), 685 states have return successors, (1049), 777 states have call predecessors, (1049), 701 states have call successors, (1049) [2023-11-06 22:24:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6972 states to 6972 states and 8251 transitions. [2023-11-06 22:24:39,202 INFO L78 Accepts]: Start accepts. Automaton has 6972 states and 8251 transitions. Word has length 141 [2023-11-06 22:24:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:39,202 INFO L495 AbstractCegarLoop]: Abstraction has 6972 states and 8251 transitions. [2023-11-06 22:24:39,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6972 states and 8251 transitions. [2023-11-06 22:24:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-06 22:24:39,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:39,210 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 22:24:39,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:39,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-06 22:24:39,415 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:39,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2023684538, now seen corresponding path program 1 times [2023-11-06 22:24:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:39,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521034645] [2023-11-06 22:24:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:24:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:24:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:24:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-06 22:24:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521034645] [2023-11-06 22:24:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521034645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885565074] [2023-11-06 22:24:39,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:39,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:39,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:39,549 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:39,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:24:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:39,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:24:39,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-06 22:24:39,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885565074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:39,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:39,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-06 22:24:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505490141] [2023-11-06 22:24:39,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:39,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:39,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:39,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:39,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:39,691 INFO L87 Difference]: Start difference. First operand 6972 states and 8251 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:40,653 INFO L93 Difference]: Finished difference Result 8282 states and 9813 transitions. [2023-11-06 22:24:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:40,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2023-11-06 22:24:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:40,664 INFO L225 Difference]: With dead ends: 8282 [2023-11-06 22:24:40,665 INFO L226 Difference]: Without dead ends: 5635 [2023-11-06 22:24:40,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:24:40,670 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 7 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:40,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1096 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5635 states. [2023-11-06 22:24:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 5635. [2023-11-06 22:24:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5635 states, 4483 states have (on average 1.16372964532679) internal successors, (5217), 4529 states have internal predecessors, (5217), 571 states have call successors, (571), 461 states have call predecessors, (571), 579 states have return successors, (852), 645 states have call predecessors, (852), 568 states have call successors, (852) [2023-11-06 22:24:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 6640 transitions. [2023-11-06 22:24:41,406 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 6640 transitions. Word has length 141 [2023-11-06 22:24:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:41,407 INFO L495 AbstractCegarLoop]: Abstraction has 5635 states and 6640 transitions. [2023-11-06 22:24:41,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 6640 transitions. [2023-11-06 22:24:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-06 22:24:41,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:41,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:41,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:41,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-06 22:24:41,612 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:41,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 685959430, now seen corresponding path program 1 times [2023-11-06 22:24:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852995532] [2023-11-06 22:24:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:24:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:24:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:24:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-06 22:24:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852995532] [2023-11-06 22:24:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852995532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:41,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:41,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:24:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031793963] [2023-11-06 22:24:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:41,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:41,772 INFO L87 Difference]: Start difference. First operand 5635 states and 6640 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-06 22:24:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:43,256 INFO L93 Difference]: Finished difference Result 5807 states and 6829 transitions. [2023-11-06 22:24:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:24:43,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 141 [2023-11-06 22:24:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:43,268 INFO L225 Difference]: With dead ends: 5807 [2023-11-06 22:24:43,268 INFO L226 Difference]: Without dead ends: 5804 [2023-11-06 22:24:43,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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-06 22:24:43,271 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 586 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:43,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 683 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:24:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2023-11-06 22:24:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5771. [2023-11-06 22:24:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5771 states, 4594 states have (on average 1.1617326948193296) internal successors, (5337), 4640 states have internal predecessors, (5337), 585 states have call successors, (585), 471 states have call predecessors, (585), 590 states have return successors, (868), 660 states have call predecessors, (868), 583 states have call successors, (868) [2023-11-06 22:24:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5771 states to 5771 states and 6790 transitions. [2023-11-06 22:24:44,076 INFO L78 Accepts]: Start accepts. Automaton has 5771 states and 6790 transitions. Word has length 141 [2023-11-06 22:24:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:44,077 INFO L495 AbstractCegarLoop]: Abstraction has 5771 states and 6790 transitions. [2023-11-06 22:24:44,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-06 22:24:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 6790 transitions. [2023-11-06 22:24:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-06 22:24:44,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:44,084 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:24:44,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:24:44,085 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:44,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1787043393, now seen corresponding path program 1 times [2023-11-06 22:24:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:44,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348971854] [2023-11-06 22:24:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:24:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:24:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:24:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:24:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:24:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:24:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:24:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:24:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:24:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:24:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:24:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:24:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:24:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-06 22:24:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348971854] [2023-11-06 22:24:44,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348971854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:44,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:24:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261381558] [2023-11-06 22:24:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:44,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:44,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:44,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:44,179 INFO L87 Difference]: Start difference. First operand 5771 states and 6790 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:24:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:45,477 INFO L93 Difference]: Finished difference Result 6319 states and 7408 transitions. [2023-11-06 22:24:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:45,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2023-11-06 22:24:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:45,488 INFO L225 Difference]: With dead ends: 6319 [2023-11-06 22:24:45,488 INFO L226 Difference]: Without dead ends: 5570 [2023-11-06 22:24:45,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:24:45,492 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 306 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:45,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 612 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:24:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2023-11-06 22:24:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5346. [2023-11-06 22:24:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5346 states, 4265 states have (on average 1.1622508792497068) internal successors, (4957), 4308 states have internal predecessors, (4957), 539 states have call successors, (539), 431 states have call predecessors, (539), 540 states have return successors, (804), 607 states have call predecessors, (804), 537 states have call successors, (804) [2023-11-06 22:24:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5346 states to 5346 states and 6300 transitions. [2023-11-06 22:24:46,319 INFO L78 Accepts]: Start accepts. Automaton has 5346 states and 6300 transitions. Word has length 147 [2023-11-06 22:24:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:46,319 INFO L495 AbstractCegarLoop]: Abstraction has 5346 states and 6300 transitions. [2023-11-06 22:24:46,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:24:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 5346 states and 6300 transitions. [2023-11-06 22:24:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:24:46,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:46,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:46,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 22:24:46,324 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:46,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1859604718, now seen corresponding path program 1 times [2023-11-06 22:24:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783230003] [2023-11-06 22:24:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:24:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:24:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:24:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:24:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:24:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:24:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:24:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:24:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:24:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783230003] [2023-11-06 22:24:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783230003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:46,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841307144] [2023-11-06 22:24:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:46,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:46,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:46,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:46,407 INFO L87 Difference]: Start difference. First operand 5346 states and 6300 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:47,571 INFO L93 Difference]: Finished difference Result 5965 states and 7003 transitions. [2023-11-06 22:24:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 145 [2023-11-06 22:24:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:47,582 INFO L225 Difference]: With dead ends: 5965 [2023-11-06 22:24:47,582 INFO L226 Difference]: Without dead ends: 5383 [2023-11-06 22:24:47,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:47,584 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 203 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:47,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 547 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:24:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5383 states. [2023-11-06 22:24:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5383 to 5348. [2023-11-06 22:24:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5348 states, 4267 states have (on average 1.1621748300913992) internal successors, (4959), 4310 states have internal predecessors, (4959), 539 states have call successors, (539), 431 states have call predecessors, (539), 540 states have return successors, (804), 607 states have call predecessors, (804), 537 states have call successors, (804) [2023-11-06 22:24:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 6302 transitions. [2023-11-06 22:24:48,487 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 6302 transitions. Word has length 145 [2023-11-06 22:24:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:48,487 INFO L495 AbstractCegarLoop]: Abstraction has 5348 states and 6302 transitions. [2023-11-06 22:24:48,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:24:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 6302 transitions. [2023-11-06 22:24:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:24:48,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:48,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:48,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 22:24:48,492 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:48,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1252673260, now seen corresponding path program 1 times [2023-11-06 22:24:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:48,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344888280] [2023-11-06 22:24:48,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:48,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:48,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:24:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:48,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:24:48,584 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:24:48,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-06 22:24:48,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-06 22:24:48,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 22:24:48,591 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-11-06 22:24:48,596 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:24:48,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:24:48 BoogieIcfgContainer [2023-11-06 22:24:48,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:24:48,734 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:24:48,734 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:24:48,734 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:24:48,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:10" (3/4) ... [2023-11-06 22:24:48,735 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:24:48,890 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:24:48,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:24:48,892 INFO L158 Benchmark]: Toolchain (without parser) took 99619.35ms. Allocated memory was 146.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 101.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-11-06 22:24:48,892 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 146.8MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:48,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.96ms. Allocated memory is still 146.8MB. Free memory was 100.8MB in the beginning and 83.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:24:48,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.38ms. Allocated memory is still 146.8MB. Free memory was 83.7MB in the beginning and 81.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:48,896 INFO L158 Benchmark]: Boogie Preprocessor took 79.29ms. Allocated memory is still 146.8MB. Free memory was 81.0MB in the beginning and 78.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:24:48,898 INFO L158 Benchmark]: RCFGBuilder took 862.51ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 78.6MB in the beginning and 173.5MB in the end (delta: -94.9MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-11-06 22:24:48,902 INFO L158 Benchmark]: TraceAbstraction took 97802.82ms. Allocated memory was 218.1MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 172.4MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-11-06 22:24:48,904 INFO L158 Benchmark]: Witness Printer took 157.06ms. Allocated memory is still 4.2GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:24:48,905 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.29ms. Allocated memory is still 146.8MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.96ms. Allocated memory is still 146.8MB. Free memory was 100.8MB in the beginning and 83.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.38ms. Allocated memory is still 146.8MB. Free memory was 83.7MB in the beginning and 81.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.29ms. Allocated memory is still 146.8MB. Free memory was 81.0MB in the beginning and 78.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 862.51ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 78.6MB in the beginning and 173.5MB in the end (delta: -94.9MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 97802.82ms. Allocated memory was 218.1MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 172.4MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 157.06ms. Allocated memory is still 4.2GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread2()=1, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L708-L719] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE, EXPR \read(tmp_ndt_2) [L727] EXPR t1_st = 1 [L728] CALL, EXPR transmit1() [L576] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET, EXPR transmit1() [L722-L733] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread2()=1, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE, EXPR \read(tmp_ndt_1) [L713] EXPR m_st = 1 [L714] CALL, EXPR master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET, EXPR master() [L708-L719] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE, EXPR \read(tmp_ndt_2) [L727] EXPR t1_st = 1 [L728] CALL, EXPR transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET, EXPR transmit1() [L722-L733] { 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, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread2()=1, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 218 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 97.6s, OverallIterations: 32, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 53.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15718 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15329 mSDsluCounter, 24830 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17450 mSDsCounter, 3254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15522 IncrementalHoareTripleChecker+Invalid, 18776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3254 mSolverCounterUnsat, 7380 mSDtfsCounter, 15522 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2522 GetRequests, 2135 SyntacticMatches, 0 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17646occurred in iteration=23, InterpolantAutomatonStates: 343, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 9532 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 4541 NumberOfCodeBlocks, 4541 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4426 ConstructedInterpolants, 0 QuantifiedInterpolants, 7744 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4573 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 43 InterpolantComputations, 30 PerfectInterpolantSequences, 1679/1776 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-06 22:24:48,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc63f6f-d687-405f-9c69-0a188db4e4a7/bin/uautomizer-verify-WvqO1wxjHP/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