./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:57:20,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:57:20,595 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:57:20,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:57:20,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:57:20,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:57:20,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:57:20,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:57:20,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:57:20,625 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:57:20,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:57:20,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:57:20,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:57:20,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:57:20,628 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:57:20,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:57:20,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:57:20,629 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:57:20,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:57:20,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:57:20,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:57:20,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:57:20,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:57:20,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:57:20,633 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:57:20,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:57:20,634 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:57:20,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:57:20,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:57:20,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:57:20,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:57:20,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:57:20,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:57:20,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:57:20,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:57:20,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:57:20,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:57:20,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:57:20,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:57:20,637 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:57:20,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:57:20,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:57:20,638 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_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2023-11-29 04:57:20,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:57:20,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:57:20,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:57:20,862 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:57:20,863 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:57:20,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2023-11-29 04:57:23,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:57:23,847 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:57:23,848 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/sv-benchmarks/c/systemc/transmitter.03.cil.c [2023-11-29 04:57:23,859 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/data/eb2f5b34e/5ab9d995cda848e68d9a56cc5a24712e/FLAG6af8ee1f3 [2023-11-29 04:57:23,871 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/data/eb2f5b34e/5ab9d995cda848e68d9a56cc5a24712e [2023-11-29 04:57:23,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:57:23,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:57:23,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:57:23,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:57:23,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:57:23,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:57:23" (1/1) ... [2023-11-29 04:57:23,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e609460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:23, skipping insertion in model container [2023-11-29 04:57:23,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:57:23" (1/1) ... [2023-11-29 04:57:23,920 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:57:24,040 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_76f8e43e-132b-4453-a529-f26b69284248/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2023-11-29 04:57:24,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:57:24,108 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:57:24,120 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_76f8e43e-132b-4453-a529-f26b69284248/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2023-11-29 04:57:24,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:57:24,167 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:57:24,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24 WrapperNode [2023-11-29 04:57:24,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:57:24,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:57:24,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:57:24,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:57:24,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,207 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 328 [2023-11-29 04:57:24,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:57:24,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:57:24,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:57:24,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:57:24,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,230 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:57:24,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:57:24,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:57:24,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:57:24,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:57:24,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (1/1) ... [2023-11-29 04:57:24,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:57:24,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:57:24,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:57:24,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:57:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:57:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-29 04:57:24,329 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-29 04:57:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-29 04:57:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-29 04:57:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 04:57:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 04:57:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-29 04:57:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-29 04:57:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-29 04:57:24,331 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-29 04:57:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:57:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-29 04:57:24,331 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-29 04:57:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:57:24,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:57:24,404 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:57:24,406 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:57:24,752 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:57:24,792 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:57:24,792 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-29 04:57:24,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:57:24 BoogieIcfgContainer [2023-11-29 04:57:24,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:57:24,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:57:24,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:57:24,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:57:24,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:57:23" (1/3) ... [2023-11-29 04:57:24,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4b02c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:57:24, skipping insertion in model container [2023-11-29 04:57:24,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:57:24" (2/3) ... [2023-11-29 04:57:24,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4b02c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:57:24, skipping insertion in model container [2023-11-29 04:57:24,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:57:24" (3/3) ... [2023-11-29 04:57:24,801 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2023-11-29 04:57:24,815 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:57:24,815 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:57:24,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:57:24,864 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@793c0e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:57:24,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:57:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 112 states have (on average 1.6785714285714286) internal successors, (188), 114 states have internal predecessors, (188), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 04:57:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:24,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:24,879 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, 1, 1, 1, 1] [2023-11-29 04:57:24,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:24,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1141548614, now seen corresponding path program 1 times [2023-11-29 04:57:24,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:24,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650482530] [2023-11-29 04:57:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:24,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:25,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:25,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650482530] [2023-11-29 04:57:25,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650482530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:25,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:25,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:57:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119605416] [2023-11-29 04:57:25,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:25,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:57:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:57:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:57:25,377 INFO L87 Difference]: Start difference. First operand has 136 states, 112 states have (on average 1.6785714285714286) internal successors, (188), 114 states have internal predecessors, (188), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:26,513 INFO L93 Difference]: Finished difference Result 466 states and 768 transitions. [2023-11-29 04:57:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:57:26,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:26,531 INFO L225 Difference]: With dead ends: 466 [2023-11-29 04:57:26,531 INFO L226 Difference]: Without dead ends: 335 [2023-11-29 04:57:26,536 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-29 04:57:26,540 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 478 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:26,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 410 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:57:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-11-29 04:57:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 260. [2023-11-29 04:57:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 219 states have (on average 1.538812785388128) internal successors, (337), 221 states have internal predecessors, (337), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2023-11-29 04:57:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2023-11-29 04:57:26,619 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 70 [2023-11-29 04:57:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:26,620 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2023-11-29 04:57:26,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2023-11-29 04:57:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:26,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:26,624 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, 1, 1, 1, 1] [2023-11-29 04:57:26,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:57:26,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:26,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1097844571, now seen corresponding path program 1 times [2023-11-29 04:57:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:26,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568780958] [2023-11-29 04:57:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:26,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:26,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:26,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568780958] [2023-11-29 04:57:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568780958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:26,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959098370] [2023-11-29 04:57:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:26,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:26,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:26,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:26,847 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:28,269 INFO L93 Difference]: Finished difference Result 798 states and 1226 transitions. [2023-11-29 04:57:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:57:28,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:28,276 INFO L225 Difference]: With dead ends: 798 [2023-11-29 04:57:28,276 INFO L226 Difference]: Without dead ends: 547 [2023-11-29 04:57:28,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:57:28,280 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 511 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:28,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 749 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:57:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2023-11-29 04:57:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 379. [2023-11-29 04:57:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 320 states have (on average 1.528125) internal successors, (489), 323 states have internal predecessors, (489), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2023-11-29 04:57:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 570 transitions. [2023-11-29 04:57:28,330 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 570 transitions. Word has length 70 [2023-11-29 04:57:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:28,330 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 570 transitions. [2023-11-29 04:57:28,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 570 transitions. [2023-11-29 04:57:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:28,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:28,334 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, 1, 1, 1, 1] [2023-11-29 04:57:28,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:57:28,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:28,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash 163072679, now seen corresponding path program 1 times [2023-11-29 04:57:28,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:28,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848058837] [2023-11-29 04:57:28,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:28,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848058837] [2023-11-29 04:57:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848058837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:28,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:28,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:28,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886036646] [2023-11-29 04:57:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:28,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:28,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:28,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:28,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:28,492 INFO L87 Difference]: Start difference. First operand 379 states and 570 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:29,107 INFO L93 Difference]: Finished difference Result 870 states and 1331 transitions. [2023-11-29 04:57:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:57:29,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:29,112 INFO L225 Difference]: With dead ends: 870 [2023-11-29 04:57:29,112 INFO L226 Difference]: Without dead ends: 500 [2023-11-29 04:57:29,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:57:29,115 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 358 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:29,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 371 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:57:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-11-29 04:57:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 379. [2023-11-29 04:57:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 320 states have (on average 1.51875) internal successors, (486), 323 states have internal predecessors, (486), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2023-11-29 04:57:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 567 transitions. [2023-11-29 04:57:29,151 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 567 transitions. Word has length 70 [2023-11-29 04:57:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:29,151 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 567 transitions. [2023-11-29 04:57:29,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 567 transitions. [2023-11-29 04:57:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:29,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:29,154 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, 1, 1, 1, 1] [2023-11-29 04:57:29,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:57:29,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:29,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:29,154 INFO L85 PathProgramCache]: Analyzing trace with hash 203747429, now seen corresponding path program 1 times [2023-11-29 04:57:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:29,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372452385] [2023-11-29 04:57:29,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:29,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:29,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:29,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:29,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:29,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372452385] [2023-11-29 04:57:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372452385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:29,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79970777] [2023-11-29 04:57:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:29,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:29,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:29,310 INFO L87 Difference]: Start difference. First operand 379 states and 567 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:30,661 INFO L93 Difference]: Finished difference Result 1289 states and 1950 transitions. [2023-11-29 04:57:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:57:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:30,669 INFO L225 Difference]: With dead ends: 1289 [2023-11-29 04:57:30,670 INFO L226 Difference]: Without dead ends: 919 [2023-11-29 04:57:30,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:57:30,672 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 519 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:30,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 734 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:57:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2023-11-29 04:57:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 617. [2023-11-29 04:57:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 524 states have (on average 1.5133587786259541) internal successors, (793), 529 states have internal predecessors, (793), 58 states have call successors, (58), 30 states have call predecessors, (58), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2023-11-29 04:57:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 922 transitions. [2023-11-29 04:57:30,719 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 922 transitions. Word has length 70 [2023-11-29 04:57:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:30,719 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 922 transitions. [2023-11-29 04:57:30,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 922 transitions. [2023-11-29 04:57:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:30,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:30,721 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, 1, 1, 1, 1] [2023-11-29 04:57:30,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:57:30,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:30,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1590532839, now seen corresponding path program 1 times [2023-11-29 04:57:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:30,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645487171] [2023-11-29 04:57:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:30,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:30,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645487171] [2023-11-29 04:57:30,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645487171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:30,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:30,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:30,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994808644] [2023-11-29 04:57:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:30,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:30,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:30,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:30,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:30,835 INFO L87 Difference]: Start difference. First operand 617 states and 922 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:31,372 INFO L93 Difference]: Finished difference Result 1396 states and 2110 transitions. [2023-11-29 04:57:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:57:31,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:31,379 INFO L225 Difference]: With dead ends: 1396 [2023-11-29 04:57:31,379 INFO L226 Difference]: Without dead ends: 788 [2023-11-29 04:57:31,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:57:31,382 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 408 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:31,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 307 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:57:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-11-29 04:57:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 617. [2023-11-29 04:57:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 524 states have (on average 1.5038167938931297) internal successors, (788), 529 states have internal predecessors, (788), 58 states have call successors, (58), 30 states have call predecessors, (58), 34 states have return successors, (71), 61 states have call predecessors, (71), 58 states have call successors, (71) [2023-11-29 04:57:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 917 transitions. [2023-11-29 04:57:31,430 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 917 transitions. Word has length 70 [2023-11-29 04:57:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:31,430 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 917 transitions. [2023-11-29 04:57:31,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 917 transitions. [2023-11-29 04:57:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:31,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:31,432 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, 1, 1, 1, 1] [2023-11-29 04:57:31,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:57:31,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:31,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1828415451, now seen corresponding path program 1 times [2023-11-29 04:57:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:31,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502011428] [2023-11-29 04:57:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:31,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502011428] [2023-11-29 04:57:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502011428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:31,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:31,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380701629] [2023-11-29 04:57:31,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:31,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:31,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:31,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:31,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:31,563 INFO L87 Difference]: Start difference. First operand 617 states and 917 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:32,899 INFO L93 Difference]: Finished difference Result 2071 states and 3089 transitions. [2023-11-29 04:57:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:57:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:32,909 INFO L225 Difference]: With dead ends: 2071 [2023-11-29 04:57:32,909 INFO L226 Difference]: Without dead ends: 1463 [2023-11-29 04:57:32,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:57:32,912 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 502 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:32,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 734 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:57:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2023-11-29 04:57:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1097. [2023-11-29 04:57:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 938 states have (on average 1.4968017057569296) internal successors, (1404), 947 states have internal predecessors, (1404), 96 states have call successors, (96), 54 states have call predecessors, (96), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2023-11-29 04:57:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1631 transitions. [2023-11-29 04:57:32,986 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1631 transitions. Word has length 70 [2023-11-29 04:57:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:32,986 INFO L495 AbstractCegarLoop]: Abstraction has 1097 states and 1631 transitions. [2023-11-29 04:57:32,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1631 transitions. [2023-11-29 04:57:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:32,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:32,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:32,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:57:32,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:32,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1384514777, now seen corresponding path program 1 times [2023-11-29 04:57:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:32,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267820925] [2023-11-29 04:57:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:33,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:33,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:33,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267820925] [2023-11-29 04:57:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267820925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:33,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:57:33,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850142090] [2023-11-29 04:57:33,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:33,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:57:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:33,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:57:33,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:57:33,137 INFO L87 Difference]: Start difference. First operand 1097 states and 1631 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:33,846 INFO L93 Difference]: Finished difference Result 2401 states and 3611 transitions. [2023-11-29 04:57:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:57:33,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:33,857 INFO L225 Difference]: With dead ends: 2401 [2023-11-29 04:57:33,857 INFO L226 Difference]: Without dead ends: 1314 [2023-11-29 04:57:33,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:57:33,862 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 209 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:33,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 431 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:57:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2023-11-29 04:57:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1099. [2023-11-29 04:57:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 940 states have (on average 1.4872340425531916) internal successors, (1398), 949 states have internal predecessors, (1398), 96 states have call successors, (96), 54 states have call predecessors, (96), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2023-11-29 04:57:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1625 transitions. [2023-11-29 04:57:33,972 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1625 transitions. Word has length 70 [2023-11-29 04:57:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:33,973 INFO L495 AbstractCegarLoop]: Abstraction has 1099 states and 1625 transitions. [2023-11-29 04:57:33,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1625 transitions. [2023-11-29 04:57:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:33,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:33,975 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, 1, 1, 1, 1] [2023-11-29 04:57:33,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:57:33,976 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:33,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash -491028439, now seen corresponding path program 1 times [2023-11-29 04:57:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:33,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858824194] [2023-11-29 04:57:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:33,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858824194] [2023-11-29 04:57:34,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858824194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:57:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810299423] [2023-11-29 04:57:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:34,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:57:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:57:34,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:57:34,102 INFO L87 Difference]: Start difference. First operand 1099 states and 1625 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:34,740 INFO L93 Difference]: Finished difference Result 2487 states and 3723 transitions. [2023-11-29 04:57:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:57:34,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:34,749 INFO L225 Difference]: With dead ends: 2487 [2023-11-29 04:57:34,749 INFO L226 Difference]: Without dead ends: 1398 [2023-11-29 04:57:34,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:57:34,754 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 212 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:34,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 430 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:57:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2023-11-29 04:57:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1117. [2023-11-29 04:57:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 958 states have (on average 1.4780793319415448) internal successors, (1416), 967 states have internal predecessors, (1416), 96 states have call successors, (96), 54 states have call predecessors, (96), 62 states have return successors, (131), 103 states have call predecessors, (131), 96 states have call successors, (131) [2023-11-29 04:57:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1643 transitions. [2023-11-29 04:57:34,880 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1643 transitions. Word has length 70 [2023-11-29 04:57:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:34,881 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1643 transitions. [2023-11-29 04:57:34,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1643 transitions. [2023-11-29 04:57:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:34,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:34,884 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, 1, 1, 1, 1] [2023-11-29 04:57:34,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:57:34,884 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:34,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1862835737, now seen corresponding path program 1 times [2023-11-29 04:57:34,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:34,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111891168] [2023-11-29 04:57:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111891168] [2023-11-29 04:57:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111891168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:35,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:35,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129054081] [2023-11-29 04:57:35,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:35,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:35,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:35,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:35,047 INFO L87 Difference]: Start difference. First operand 1117 states and 1643 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:36,508 INFO L93 Difference]: Finished difference Result 5978 states and 8973 transitions. [2023-11-29 04:57:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:57:36,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:36,530 INFO L225 Difference]: With dead ends: 5978 [2023-11-29 04:57:36,530 INFO L226 Difference]: Without dead ends: 4871 [2023-11-29 04:57:36,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:57:36,535 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 1120 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:36,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 628 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:57:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2023-11-29 04:57:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4086. [2023-11-29 04:57:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 3520 states have (on average 1.4659090909090908) internal successors, (5160), 3553 states have internal predecessors, (5160), 325 states have call successors, (325), 206 states have call predecessors, (325), 240 states have return successors, (536), 334 states have call predecessors, (536), 325 states have call successors, (536) [2023-11-29 04:57:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 6021 transitions. [2023-11-29 04:57:36,852 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 6021 transitions. Word has length 70 [2023-11-29 04:57:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:36,852 INFO L495 AbstractCegarLoop]: Abstraction has 4086 states and 6021 transitions. [2023-11-29 04:57:36,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 6021 transitions. [2023-11-29 04:57:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:36,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:36,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:36,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:57:36,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:36,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1339515066, now seen corresponding path program 1 times [2023-11-29 04:57:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:36,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397252730] [2023-11-29 04:57:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:36,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397252730] [2023-11-29 04:57:36,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397252730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:36,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:36,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:57:36,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696895553] [2023-11-29 04:57:36,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:36,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:57:36,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:36,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:57:36,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:57:36,966 INFO L87 Difference]: Start difference. First operand 4086 states and 6021 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:37,758 INFO L93 Difference]: Finished difference Result 8859 states and 13346 transitions. [2023-11-29 04:57:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:57:37,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:37,781 INFO L225 Difference]: With dead ends: 8859 [2023-11-29 04:57:37,781 INFO L226 Difference]: Without dead ends: 4783 [2023-11-29 04:57:37,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:57:37,793 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 200 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:37,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 430 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:57:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2023-11-29 04:57:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4122. [2023-11-29 04:57:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4122 states, 3556 states have (on average 1.4561304836895388) internal successors, (5178), 3589 states have internal predecessors, (5178), 325 states have call successors, (325), 206 states have call predecessors, (325), 240 states have return successors, (536), 334 states have call predecessors, (536), 325 states have call successors, (536) [2023-11-29 04:57:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 6039 transitions. [2023-11-29 04:57:38,092 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 6039 transitions. Word has length 70 [2023-11-29 04:57:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:38,093 INFO L495 AbstractCegarLoop]: Abstraction has 4122 states and 6039 transitions. [2023-11-29 04:57:38,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 6039 transitions. [2023-11-29 04:57:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:57:38,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:38,096 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, 1, 1, 1, 1] [2023-11-29 04:57:38,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:57:38,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:38,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2111446728, now seen corresponding path program 1 times [2023-11-29 04:57:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:38,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749107898] [2023-11-29 04:57:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:38,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:38,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:38,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:38,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:38,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749107898] [2023-11-29 04:57:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749107898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:38,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:38,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:38,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140721125] [2023-11-29 04:57:38,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:38,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:38,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:38,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:38,241 INFO L87 Difference]: Start difference. First operand 4122 states and 6039 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:39,959 INFO L93 Difference]: Finished difference Result 13304 states and 19703 transitions. [2023-11-29 04:57:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:57:39,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 04:57:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:40,033 INFO L225 Difference]: With dead ends: 13304 [2023-11-29 04:57:40,033 INFO L226 Difference]: Without dead ends: 9192 [2023-11-29 04:57:40,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:57:40,046 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 1244 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:40,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 639 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:57:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9192 states. [2023-11-29 04:57:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9192 to 6077. [2023-11-29 04:57:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6077 states, 5238 states have (on average 1.4486445208094694) internal successors, (7588), 5287 states have internal predecessors, (7588), 480 states have call successors, (480), 308 states have call predecessors, (480), 358 states have return successors, (747), 489 states have call predecessors, (747), 480 states have call successors, (747) [2023-11-29 04:57:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6077 states to 6077 states and 8815 transitions. [2023-11-29 04:57:40,494 INFO L78 Accepts]: Start accepts. Automaton has 6077 states and 8815 transitions. Word has length 70 [2023-11-29 04:57:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:40,494 INFO L495 AbstractCegarLoop]: Abstraction has 6077 states and 8815 transitions. [2023-11-29 04:57:40,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6077 states and 8815 transitions. [2023-11-29 04:57:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:57:40,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:40,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:40,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:57:40,498 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:40,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2041081219, now seen corresponding path program 1 times [2023-11-29 04:57:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:40,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186188240] [2023-11-29 04:57:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:40,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:40,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:40,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186188240] [2023-11-29 04:57:40,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186188240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:40,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:40,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:57:40,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966026662] [2023-11-29 04:57:40,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:40,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:57:40,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:40,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:57:40,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:57:40,605 INFO L87 Difference]: Start difference. First operand 6077 states and 8815 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:41,420 INFO L93 Difference]: Finished difference Result 13072 states and 19282 transitions. [2023-11-29 04:57:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:57:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-11-29 04:57:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:41,452 INFO L225 Difference]: With dead ends: 13072 [2023-11-29 04:57:41,452 INFO L226 Difference]: Without dead ends: 7005 [2023-11-29 04:57:41,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:57:41,470 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 178 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:41,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 427 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:57:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7005 states. [2023-11-29 04:57:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7005 to 6149. [2023-11-29 04:57:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 5310 states have (on average 1.4391713747645951) internal successors, (7642), 5359 states have internal predecessors, (7642), 480 states have call successors, (480), 308 states have call predecessors, (480), 358 states have return successors, (747), 489 states have call predecessors, (747), 480 states have call successors, (747) [2023-11-29 04:57:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8869 transitions. [2023-11-29 04:57:42,050 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8869 transitions. Word has length 75 [2023-11-29 04:57:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:42,051 INFO L495 AbstractCegarLoop]: Abstraction has 6149 states and 8869 transitions. [2023-11-29 04:57:42,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8869 transitions. [2023-11-29 04:57:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:57:42,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:42,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:42,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:57:42,056 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:42,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1197075717, now seen corresponding path program 1 times [2023-11-29 04:57:42,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:42,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93497910] [2023-11-29 04:57:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:42,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:42,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:42,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93497910] [2023-11-29 04:57:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93497910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:42,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:57:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984136087] [2023-11-29 04:57:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:42,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:57:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:57:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:57:42,289 INFO L87 Difference]: Start difference. First operand 6149 states and 8869 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:44,085 INFO L93 Difference]: Finished difference Result 22798 states and 32707 transitions. [2023-11-29 04:57:44,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:57:44,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-11-29 04:57:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:44,146 INFO L225 Difference]: With dead ends: 22798 [2023-11-29 04:57:44,146 INFO L226 Difference]: Without dead ends: 16660 [2023-11-29 04:57:44,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:57:44,166 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 669 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:44,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 562 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:57:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16660 states. [2023-11-29 04:57:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16660 to 11547. [2023-11-29 04:57:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11547 states, 9930 states have (on average 1.4193353474320243) internal successors, (14094), 10069 states have internal predecessors, (14094), 894 states have call successors, (894), 580 states have call predecessors, (894), 722 states have return successors, (1491), 913 states have call predecessors, (1491), 894 states have call successors, (1491) [2023-11-29 04:57:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11547 states to 11547 states and 16479 transitions. [2023-11-29 04:57:45,266 INFO L78 Accepts]: Start accepts. Automaton has 11547 states and 16479 transitions. Word has length 75 [2023-11-29 04:57:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:45,267 INFO L495 AbstractCegarLoop]: Abstraction has 11547 states and 16479 transitions. [2023-11-29 04:57:45,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 11547 states and 16479 transitions. [2023-11-29 04:57:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:57:45,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:45,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:45,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:57:45,276 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:45,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1219707971, now seen corresponding path program 1 times [2023-11-29 04:57:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867455279] [2023-11-29 04:57:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:45,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:45,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:45,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867455279] [2023-11-29 04:57:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867455279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:45,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:57:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277605164] [2023-11-29 04:57:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:45,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:57:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:45,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:57:45,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:57:45,501 INFO L87 Difference]: Start difference. First operand 11547 states and 16479 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:47,204 INFO L93 Difference]: Finished difference Result 16222 states and 23042 transitions. [2023-11-29 04:57:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:57:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-11-29 04:57:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:47,229 INFO L225 Difference]: With dead ends: 16222 [2023-11-29 04:57:47,229 INFO L226 Difference]: Without dead ends: 9856 [2023-11-29 04:57:47,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:57:47,245 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 668 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:47,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 559 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:57:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9856 states. [2023-11-29 04:57:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9856 to 6705. [2023-11-29 04:57:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6705 states, 5752 states have (on average 1.400904033379694) internal successors, (8058), 5819 states have internal predecessors, (8058), 540 states have call successors, (540), 344 states have call predecessors, (540), 412 states have return successors, (802), 549 states have call predecessors, (802), 540 states have call successors, (802) [2023-11-29 04:57:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 9400 transitions. [2023-11-29 04:57:47,918 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 9400 transitions. Word has length 75 [2023-11-29 04:57:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:47,918 INFO L495 AbstractCegarLoop]: Abstraction has 6705 states and 9400 transitions. [2023-11-29 04:57:47,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 9400 transitions. [2023-11-29 04:57:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:57:47,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:47,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:47,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:57:47,923 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:47,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1689055931, now seen corresponding path program 1 times [2023-11-29 04:57:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487637058] [2023-11-29 04:57:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:48,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:48,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:48,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487637058] [2023-11-29 04:57:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487637058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:48,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:48,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924223669] [2023-11-29 04:57:48,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:48,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:48,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:48,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:48,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:48,063 INFO L87 Difference]: Start difference. First operand 6705 states and 9400 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:48,956 INFO L93 Difference]: Finished difference Result 14262 states and 20165 transitions. [2023-11-29 04:57:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:57:48,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-11-29 04:57:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:48,976 INFO L225 Difference]: With dead ends: 14262 [2023-11-29 04:57:48,976 INFO L226 Difference]: Without dead ends: 7570 [2023-11-29 04:57:48,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:57:48,989 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 409 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:48,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 370 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:57:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2023-11-29 04:57:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 6681. [2023-11-29 04:57:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6681 states, 5728 states have (on average 1.3816340782122905) internal successors, (7914), 5795 states have internal predecessors, (7914), 540 states have call successors, (540), 344 states have call predecessors, (540), 412 states have return successors, (802), 549 states have call predecessors, (802), 540 states have call successors, (802) [2023-11-29 04:57:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 9256 transitions. [2023-11-29 04:57:49,479 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 9256 transitions. Word has length 75 [2023-11-29 04:57:49,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:49,479 INFO L495 AbstractCegarLoop]: Abstraction has 6681 states and 9256 transitions. [2023-11-29 04:57:49,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 9256 transitions. [2023-11-29 04:57:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:57:49,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:49,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:49,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:57:49,482 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:49,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:49,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2096438275, now seen corresponding path program 1 times [2023-11-29 04:57:49,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:49,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766089558] [2023-11-29 04:57:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766089558] [2023-11-29 04:57:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766089558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:57:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516660397] [2023-11-29 04:57:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:49,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:57:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:49,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:57:49,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:57:49,651 INFO L87 Difference]: Start difference. First operand 6681 states and 9256 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:51,319 INFO L93 Difference]: Finished difference Result 15498 states and 21513 transitions. [2023-11-29 04:57:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:57:51,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-11-29 04:57:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:51,344 INFO L225 Difference]: With dead ends: 15498 [2023-11-29 04:57:51,344 INFO L226 Difference]: Without dead ends: 10032 [2023-11-29 04:57:51,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:57:51,356 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 845 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:51,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 495 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:57:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10032 states. [2023-11-29 04:57:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10032 to 6639. [2023-11-29 04:57:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6639 states, 5698 states have (on average 1.3738153738153738) internal successors, (7828), 5753 states have internal predecessors, (7828), 540 states have call successors, (540), 344 states have call predecessors, (540), 400 states have return successors, (750), 545 states have call predecessors, (750), 540 states have call successors, (750) [2023-11-29 04:57:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6639 states to 6639 states and 9118 transitions. [2023-11-29 04:57:51,961 INFO L78 Accepts]: Start accepts. Automaton has 6639 states and 9118 transitions. Word has length 75 [2023-11-29 04:57:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:51,962 INFO L495 AbstractCegarLoop]: Abstraction has 6639 states and 9118 transitions. [2023-11-29 04:57:51,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 6639 states and 9118 transitions. [2023-11-29 04:57:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:57:51,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:51,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:51,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:57:51,966 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:51,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash -275300987, now seen corresponding path program 1 times [2023-11-29 04:57:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881123910] [2023-11-29 04:57:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:52,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:52,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881123910] [2023-11-29 04:57:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881123910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:52,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:52,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:57:52,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15196739] [2023-11-29 04:57:52,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:52,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:57:52,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:52,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:57:52,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:57:52,128 INFO L87 Difference]: Start difference. First operand 6639 states and 9118 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:53,318 INFO L93 Difference]: Finished difference Result 15308 states and 21195 transitions. [2023-11-29 04:57:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:57:53,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-11-29 04:57:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:53,340 INFO L225 Difference]: With dead ends: 15308 [2023-11-29 04:57:53,340 INFO L226 Difference]: Without dead ends: 8682 [2023-11-29 04:57:53,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:57:53,354 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 549 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:53,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 373 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:57:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2023-11-29 04:57:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 7003. [2023-11-29 04:57:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7003 states, 6036 states have (on average 1.3469184890656063) internal successors, (8130), 6091 states have internal predecessors, (8130), 548 states have call successors, (548), 362 states have call predecessors, (548), 418 states have return successors, (774), 553 states have call predecessors, (774), 548 states have call successors, (774) [2023-11-29 04:57:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7003 states to 7003 states and 9452 transitions. [2023-11-29 04:57:53,926 INFO L78 Accepts]: Start accepts. Automaton has 7003 states and 9452 transitions. Word has length 75 [2023-11-29 04:57:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:53,927 INFO L495 AbstractCegarLoop]: Abstraction has 7003 states and 9452 transitions. [2023-11-29 04:57:53,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 7003 states and 9452 transitions. [2023-11-29 04:57:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:57:53,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:53,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:53,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:57:53,930 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:53,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash -213261373, now seen corresponding path program 1 times [2023-11-29 04:57:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052257908] [2023-11-29 04:57:53,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:54,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:54,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:54,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:54,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:54,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:54,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052257908] [2023-11-29 04:57:54,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052257908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:54,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:54,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:57:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238673664] [2023-11-29 04:57:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:54,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:57:54,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:57:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:57:54,093 INFO L87 Difference]: Start difference. First operand 7003 states and 9452 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:55,616 INFO L93 Difference]: Finished difference Result 15507 states and 21122 transitions. [2023-11-29 04:57:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:57:55,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-11-29 04:57:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:55,641 INFO L225 Difference]: With dead ends: 15507 [2023-11-29 04:57:55,641 INFO L226 Difference]: Without dead ends: 9293 [2023-11-29 04:57:55,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:57:55,651 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 658 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:55,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 555 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:57:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9293 states. [2023-11-29 04:57:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9293 to 6439. [2023-11-29 04:57:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6439 states, 5608 states have (on average 1.3352353780313837) internal successors, (7488), 5635 states have internal predecessors, (7488), 484 states have call successors, (484), 318 states have call predecessors, (484), 346 states have return successors, (652), 487 states have call predecessors, (652), 484 states have call successors, (652) [2023-11-29 04:57:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6439 states to 6439 states and 8624 transitions. [2023-11-29 04:57:56,014 INFO L78 Accepts]: Start accepts. Automaton has 6439 states and 8624 transitions. Word has length 75 [2023-11-29 04:57:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:56,014 INFO L495 AbstractCegarLoop]: Abstraction has 6439 states and 8624 transitions. [2023-11-29 04:57:56,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 6439 states and 8624 transitions. [2023-11-29 04:57:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:57:56,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:56,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:56,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:57:56,016 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:56,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:56,016 INFO L85 PathProgramCache]: Analyzing trace with hash -72712763, now seen corresponding path program 1 times [2023-11-29 04:57:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:56,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710575583] [2023-11-29 04:57:56,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:56,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:56,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:56,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:56,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:56,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710575583] [2023-11-29 04:57:56,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710575583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:56,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:56,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:57:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491741111] [2023-11-29 04:57:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:56,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:57:56,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:57:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:57:56,111 INFO L87 Difference]: Start difference. First operand 6439 states and 8624 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:57,248 INFO L93 Difference]: Finished difference Result 20822 states and 28061 transitions. [2023-11-29 04:57:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:57:57,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2023-11-29 04:57:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:57,274 INFO L225 Difference]: With dead ends: 20822 [2023-11-29 04:57:57,275 INFO L226 Difference]: Without dead ends: 14396 [2023-11-29 04:57:57,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:57:57,287 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 663 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:57,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 410 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:57:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14396 states. [2023-11-29 04:57:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14396 to 12470. [2023-11-29 04:57:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12470 states, 10866 states have (on average 1.3104178170439904) internal successors, (14239), 10927 states have internal predecessors, (14239), 915 states have call successors, (915), 616 states have call predecessors, (915), 688 states have return successors, (1420), 930 states have call predecessors, (1420), 915 states have call successors, (1420) [2023-11-29 04:57:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12470 states to 12470 states and 16574 transitions. [2023-11-29 04:57:57,955 INFO L78 Accepts]: Start accepts. Automaton has 12470 states and 16574 transitions. Word has length 75 [2023-11-29 04:57:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:57,955 INFO L495 AbstractCegarLoop]: Abstraction has 12470 states and 16574 transitions. [2023-11-29 04:57:57,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 12470 states and 16574 transitions. [2023-11-29 04:57:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 04:57:57,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:57,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:57,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:57:57,957 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:57,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1978702352, now seen corresponding path program 1 times [2023-11-29 04:57:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:57,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337781006] [2023-11-29 04:57:57,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:57,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:57,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:57,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:57:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:58,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:57:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337781006] [2023-11-29 04:57:58,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337781006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:58,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:57:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604384124] [2023-11-29 04:57:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:58,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:57:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:57:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:57:58,010 INFO L87 Difference]: Start difference. First operand 12470 states and 16574 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:58,954 INFO L93 Difference]: Finished difference Result 26926 states and 35838 transitions. [2023-11-29 04:57:58,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:57:58,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 76 [2023-11-29 04:57:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:58,980 INFO L225 Difference]: With dead ends: 26926 [2023-11-29 04:57:58,980 INFO L226 Difference]: Without dead ends: 14469 [2023-11-29 04:57:59,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:57:59,046 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 405 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:59,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 228 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:57:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14469 states. [2023-11-29 04:57:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14469 to 12461. [2023-11-29 04:57:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12461 states, 10862 states have (on average 1.3101638740563433) internal successors, (14231), 10922 states have internal predecessors, (14231), 910 states have call successors, (910), 616 states have call predecessors, (910), 688 states have return successors, (1414), 924 states have call predecessors, (1414), 910 states have call successors, (1414) [2023-11-29 04:57:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12461 states to 12461 states and 16555 transitions. [2023-11-29 04:57:59,927 INFO L78 Accepts]: Start accepts. Automaton has 12461 states and 16555 transitions. Word has length 76 [2023-11-29 04:57:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:59,927 INFO L495 AbstractCegarLoop]: Abstraction has 12461 states and 16555 transitions. [2023-11-29 04:57:59,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:57:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 12461 states and 16555 transitions. [2023-11-29 04:57:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 04:57:59,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:59,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:59,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:57:59,929 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:57:59,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:59,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1249744717, now seen corresponding path program 1 times [2023-11-29 04:57:59,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:59,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683272769] [2023-11-29 04:57:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:59,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:57:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:57:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:59,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:57:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:00,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:58:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:00,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:00,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683272769] [2023-11-29 04:58:00,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683272769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:00,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:00,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:58:00,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235538838] [2023-11-29 04:58:00,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:00,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:58:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:00,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:58:00,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:58:00,024 INFO L87 Difference]: Start difference. First operand 12461 states and 16555 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:58:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:01,771 INFO L93 Difference]: Finished difference Result 40998 states and 54628 transitions. [2023-11-29 04:58:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:58:01,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2023-11-29 04:58:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:01,828 INFO L225 Difference]: With dead ends: 40998 [2023-11-29 04:58:01,828 INFO L226 Difference]: Without dead ends: 28550 [2023-11-29 04:58:01,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:58:01,848 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 520 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:01,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 491 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:58:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28550 states. [2023-11-29 04:58:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28550 to 24538. [2023-11-29 04:58:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24538 states, 21394 states have (on average 1.2968589324109563) internal successors, (27745), 21535 states have internal predecessors, (27745), 1759 states have call successors, (1759), 1208 states have call predecessors, (1759), 1384 states have return successors, (2901), 1798 states have call predecessors, (2901), 1759 states have call successors, (2901) [2023-11-29 04:58:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24538 states to 24538 states and 32405 transitions. [2023-11-29 04:58:03,079 INFO L78 Accepts]: Start accepts. Automaton has 24538 states and 32405 transitions. Word has length 77 [2023-11-29 04:58:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:03,080 INFO L495 AbstractCegarLoop]: Abstraction has 24538 states and 32405 transitions. [2023-11-29 04:58:03,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:58:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 24538 states and 32405 transitions. [2023-11-29 04:58:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 04:58:03,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:03,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 04:58:03,082 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:03,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash 658713073, now seen corresponding path program 1 times [2023-11-29 04:58:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:58:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040468861] [2023-11-29 04:58:03,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:58:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:03,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:58:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:58:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:03,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:58:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040468861] [2023-11-29 04:58:03,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040468861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:03,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:03,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:58:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217488965] [2023-11-29 04:58:03,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:03,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:58:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:03,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:58:03,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:58:03,140 INFO L87 Difference]: Start difference. First operand 24538 states and 32405 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:58:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:04,574 INFO L93 Difference]: Finished difference Result 50318 states and 66620 transitions. [2023-11-29 04:58:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:58:04,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2023-11-29 04:58:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:04,620 INFO L225 Difference]: With dead ends: 50318 [2023-11-29 04:58:04,620 INFO L226 Difference]: Without dead ends: 25793 [2023-11-29 04:58:04,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:58:04,644 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 404 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:04,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 226 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:58:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25793 states. [2023-11-29 04:58:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25793 to 22126. [2023-11-29 04:58:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22126 states, 19317 states have (on average 1.298907697882694) internal successors, (25091), 19443 states have internal predecessors, (25091), 1566 states have call successors, (1566), 1080 states have call predecessors, (1566), 1242 states have return successors, (2609), 1604 states have call predecessors, (2609), 1566 states have call successors, (2609) [2023-11-29 04:58:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 29266 transitions. [2023-11-29 04:58:05,900 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 29266 transitions. Word has length 77 [2023-11-29 04:58:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:05,900 INFO L495 AbstractCegarLoop]: Abstraction has 22126 states and 29266 transitions. [2023-11-29 04:58:05,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:58:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 29266 transitions. [2023-11-29 04:58:05,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 04:58:05,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:05,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:05,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 04:58:05,902 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:05,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:05,902 INFO L85 PathProgramCache]: Analyzing trace with hash -739521064, now seen corresponding path program 1 times [2023-11-29 04:58:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:58:05,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453198852] [2023-11-29 04:58:05,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:05,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:58:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:05,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:58:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:58:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:58:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:05,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:05,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453198852] [2023-11-29 04:58:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453198852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:05,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:58:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503805161] [2023-11-29 04:58:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:05,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:58:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:58:05,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:58:05,973 INFO L87 Difference]: Start difference. First operand 22126 states and 29266 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 04:58:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:08,363 INFO L93 Difference]: Finished difference Result 60332 states and 80748 transitions. [2023-11-29 04:58:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:58:08,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 79 [2023-11-29 04:58:08,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:08,437 INFO L225 Difference]: With dead ends: 60332 [2023-11-29 04:58:08,438 INFO L226 Difference]: Without dead ends: 43160 [2023-11-29 04:58:08,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:58:08,465 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 539 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:08,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 300 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:58:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2023-11-29 04:58:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 35693. [2023-11-29 04:58:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35693 states, 30983 states have (on average 1.2889971920085208) internal successors, (39937), 31198 states have internal predecessors, (39937), 2610 states have call successors, (2610), 1812 states have call predecessors, (2610), 2099 states have return successors, (4499), 2684 states have call predecessors, (4499), 2610 states have call successors, (4499) [2023-11-29 04:58:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35693 states to 35693 states and 47046 transitions. [2023-11-29 04:58:10,520 INFO L78 Accepts]: Start accepts. Automaton has 35693 states and 47046 transitions. Word has length 79 [2023-11-29 04:58:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:10,520 INFO L495 AbstractCegarLoop]: Abstraction has 35693 states and 47046 transitions. [2023-11-29 04:58:10,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 04:58:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 35693 states and 47046 transitions. [2023-11-29 04:58:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 04:58:10,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:10,526 INFO L195 NwaCegarLoop]: trace histogram [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-29 04:58:10,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 04:58:10,526 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:10,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1282339458, now seen corresponding path program 1 times [2023-11-29 04:58:10,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:58:10,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907009938] [2023-11-29 04:58:10,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:10,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:58:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:10,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:58:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:10,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:58:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:10,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:58:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:58:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 04:58:10,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:10,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907009938] [2023-11-29 04:58:10,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907009938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:10,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:10,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:58:10,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237711733] [2023-11-29 04:58:10,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:10,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:58:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:10,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:58:10,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:58:10,617 INFO L87 Difference]: Start difference. First operand 35693 states and 47046 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 04:58:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:14,989 INFO L93 Difference]: Finished difference Result 112088 states and 148129 transitions. [2023-11-29 04:58:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:58:14,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 95 [2023-11-29 04:58:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:15,168 INFO L225 Difference]: With dead ends: 112088 [2023-11-29 04:58:15,169 INFO L226 Difference]: Without dead ends: 76408 [2023-11-29 04:58:15,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:58:15,223 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 625 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:15,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 431 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:58:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76408 states. [2023-11-29 04:58:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76408 to 67288. [2023-11-29 04:58:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67288 states, 58158 states have (on average 1.276144296571409) internal successors, (74218), 58626 states have internal predecessors, (74218), 5059 states have call successors, (5059), 3464 states have call predecessors, (5059), 4070 states have return successors, (9049), 5201 states have call predecessors, (9049), 5059 states have call successors, (9049) [2023-11-29 04:58:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67288 states to 67288 states and 88326 transitions. [2023-11-29 04:58:19,480 INFO L78 Accepts]: Start accepts. Automaton has 67288 states and 88326 transitions. Word has length 95 [2023-11-29 04:58:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:19,480 INFO L495 AbstractCegarLoop]: Abstraction has 67288 states and 88326 transitions. [2023-11-29 04:58:19,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 04:58:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 67288 states and 88326 transitions. [2023-11-29 04:58:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 04:58:19,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:19,486 INFO L195 NwaCegarLoop]: trace histogram [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-29 04:58:19,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 04:58:19,487 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:19,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash 511605892, now seen corresponding path program 1 times [2023-11-29 04:58:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:58:19,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356695342] [2023-11-29 04:58:19,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:19,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:58:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:19,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:19,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:58:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:19,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:58:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:58:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 04:58:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 04:58:19,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:19,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356695342] [2023-11-29 04:58:19,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356695342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:19,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:19,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:58:19,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927091777] [2023-11-29 04:58:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:19,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:58:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:58:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:58:19,559 INFO L87 Difference]: Start difference. First operand 67288 states and 88326 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:58:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:24,680 INFO L93 Difference]: Finished difference Result 136805 states and 179540 transitions. [2023-11-29 04:58:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:58:24,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 95 [2023-11-29 04:58:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:24,837 INFO L225 Difference]: With dead ends: 136805 [2023-11-29 04:58:24,837 INFO L226 Difference]: Without dead ends: 69530 [2023-11-29 04:58:24,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:58:24,899 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 404 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:24,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 223 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:58:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69530 states. [2023-11-29 04:58:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69530 to 61167. [2023-11-29 04:58:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61167 states, 52943 states have (on average 1.2774493323007763) internal successors, (67632), 53374 states have internal predecessors, (67632), 4538 states have call successors, (4538), 3116 states have call predecessors, (4538), 3685 states have return successors, (8235), 4678 states have call predecessors, (8235), 4538 states have call successors, (8235) [2023-11-29 04:58:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61167 states to 61167 states and 80405 transitions. [2023-11-29 04:58:28,585 INFO L78 Accepts]: Start accepts. Automaton has 61167 states and 80405 transitions. Word has length 95 [2023-11-29 04:58:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:28,586 INFO L495 AbstractCegarLoop]: Abstraction has 61167 states and 80405 transitions. [2023-11-29 04:58:28,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 04:58:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 61167 states and 80405 transitions. [2023-11-29 04:58:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-29 04:58:28,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:28,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:28,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 04:58:28,592 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:28,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash 75596578, now seen corresponding path program 1 times [2023-11-29 04:58:28,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:58:28,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548926539] [2023-11-29 04:58:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:58:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:58:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:58:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:28,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:58:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 04:58:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:58:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:28,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548926539] [2023-11-29 04:58:28,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548926539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:28,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:28,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:58:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979272599] [2023-11-29 04:58:28,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:28,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:58:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:28,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:58:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:58:28,700 INFO L87 Difference]: Start difference. First operand 61167 states and 80405 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 04:58:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:36,916 INFO L93 Difference]: Finished difference Result 197519 states and 260321 transitions. [2023-11-29 04:58:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:58:36,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 99 [2023-11-29 04:58:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:37,159 INFO L225 Difference]: With dead ends: 197519 [2023-11-29 04:58:37,159 INFO L226 Difference]: Without dead ends: 102924 [2023-11-29 04:58:37,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:58:37,267 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 951 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:37,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 516 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:58:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102924 states. [2023-11-29 04:58:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102924 to 93049. [2023-11-29 04:58:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93049 states, 80546 states have (on average 1.269572666550791) internal successors, (102259), 81473 states have internal predecessors, (102259), 6640 states have call successors, (6640), 4564 states have call predecessors, (6640), 5862 states have return successors, (14933), 7013 states have call predecessors, (14933), 6640 states have call successors, (14933) [2023-11-29 04:58:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93049 states to 93049 states and 123832 transitions. [2023-11-29 04:58:43,027 INFO L78 Accepts]: Start accepts. Automaton has 93049 states and 123832 transitions. Word has length 99 [2023-11-29 04:58:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:43,027 INFO L495 AbstractCegarLoop]: Abstraction has 93049 states and 123832 transitions. [2023-11-29 04:58:43,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 04:58:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 93049 states and 123832 transitions. [2023-11-29 04:58:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-29 04:58:43,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:43,055 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, 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-29 04:58:43,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 04:58:43,055 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:43,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1902501597, now seen corresponding path program 1 times [2023-11-29 04:58:43,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:58:43,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133819202] [2023-11-29 04:58:43,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:43,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:58:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:58:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:58:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:58:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 04:58:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 04:58:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:58:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 04:58:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133819202] [2023-11-29 04:58:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133819202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:43,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:43,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:58:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624489588] [2023-11-29 04:58:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:43,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:58:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:58:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:58:43,227 INFO L87 Difference]: Start difference. First operand 93049 states and 123832 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 04:58:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:49,827 INFO L93 Difference]: Finished difference Result 195918 states and 264658 transitions. [2023-11-29 04:58:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 04:58:49,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 130 [2023-11-29 04:58:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:50,102 INFO L225 Difference]: With dead ends: 195918 [2023-11-29 04:58:50,103 INFO L226 Difference]: Without dead ends: 114870 [2023-11-29 04:58:50,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:58:50,206 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1308 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:50,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 370 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:58:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114870 states. [2023-11-29 04:58:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114870 to 99074. [2023-11-29 04:58:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99074 states, 85323 states have (on average 1.2326453593989897) internal successors, (105173), 86807 states have internal predecessors, (105173), 6898 states have call successors, (6898), 5056 states have call predecessors, (6898), 6852 states have return successors, (14686), 7212 states have call predecessors, (14686), 6898 states have call successors, (14686) [2023-11-29 04:58:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99074 states to 99074 states and 126757 transitions. [2023-11-29 04:58:56,982 INFO L78 Accepts]: Start accepts. Automaton has 99074 states and 126757 transitions. Word has length 130 [2023-11-29 04:58:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:56,982 INFO L495 AbstractCegarLoop]: Abstraction has 99074 states and 126757 transitions. [2023-11-29 04:58:56,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 04:58:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 99074 states and 126757 transitions. [2023-11-29 04:58:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 04:58:57,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:57,012 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:57,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 04:58:57,012 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:57,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1597951225, now seen corresponding path program 1 times [2023-11-29 04:58:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:58:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529880189] [2023-11-29 04:58:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:58:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:58:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:58:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:58:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:58:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:58:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:58:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 04:58:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:58:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-29 04:58:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:58:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529880189] [2023-11-29 04:58:57,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529880189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:57,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:57,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:58:57,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871989756] [2023-11-29 04:58:57,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:57,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:58:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:58:57,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:58:57,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:58:57,101 INFO L87 Difference]: Start difference. First operand 99074 states and 126757 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 04:59:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:04,078 INFO L93 Difference]: Finished difference Result 226363 states and 289373 transitions. [2023-11-29 04:59:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:59:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 131 [2023-11-29 04:59:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:04,412 INFO L225 Difference]: With dead ends: 226363 [2023-11-29 04:59:04,412 INFO L226 Difference]: Without dead ends: 130566 [2023-11-29 04:59:04,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:59:04,543 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 513 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:04,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 314 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:59:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130566 states. [2023-11-29 04:59:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130566 to 114905. [2023-11-29 04:59:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114905 states, 99094 states have (on average 1.2314872747088623) internal successors, (122033), 100785 states have internal predecessors, (122033), 7962 states have call successors, (7962), 5832 states have call predecessors, (7962), 7848 states have return successors, (16577), 8289 states have call predecessors, (16577), 7962 states have call successors, (16577) [2023-11-29 04:59:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114905 states to 114905 states and 146572 transitions. [2023-11-29 04:59:11,988 INFO L78 Accepts]: Start accepts. Automaton has 114905 states and 146572 transitions. Word has length 131 [2023-11-29 04:59:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:11,988 INFO L495 AbstractCegarLoop]: Abstraction has 114905 states and 146572 transitions. [2023-11-29 04:59:11,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 04:59:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 114905 states and 146572 transitions. [2023-11-29 04:59:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 04:59:12,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:12,009 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, 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-29 04:59:12,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 04:59:12,010 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:59:12,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1325878491, now seen corresponding path program 1 times [2023-11-29 04:59:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:59:12,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739221474] [2023-11-29 04:59:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:59:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:59:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:59:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:59:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:59:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:59:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 04:59:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 04:59:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 04:59:12,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:59:12,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739221474] [2023-11-29 04:59:12,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739221474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:12,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:12,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:59:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624212559] [2023-11-29 04:59:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:12,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:59:12,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:59:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:59:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:59:12,096 INFO L87 Difference]: Start difference. First operand 114905 states and 146572 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-29 04:59:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:19,277 INFO L93 Difference]: Finished difference Result 222033 states and 282808 transitions. [2023-11-29 04:59:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:59:19,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 133 [2023-11-29 04:59:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:19,572 INFO L225 Difference]: With dead ends: 222033 [2023-11-29 04:59:19,572 INFO L226 Difference]: Without dead ends: 126376 [2023-11-29 04:59:19,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:59:19,688 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 848 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:19,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 569 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:59:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126376 states. [2023-11-29 04:59:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126376 to 111449. [2023-11-29 04:59:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111449 states, 96165 states have (on average 1.2282223262101597) internal successors, (118112), 97812 states have internal predecessors, (118112), 7682 states have call successors, (7682), 5630 states have call predecessors, (7682), 7601 states have return successors, (15947), 8008 states have call predecessors, (15947), 7682 states have call successors, (15947) [2023-11-29 04:59:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111449 states to 111449 states and 141741 transitions. [2023-11-29 04:59:26,970 INFO L78 Accepts]: Start accepts. Automaton has 111449 states and 141741 transitions. Word has length 133 [2023-11-29 04:59:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:26,970 INFO L495 AbstractCegarLoop]: Abstraction has 111449 states and 141741 transitions. [2023-11-29 04:59:26,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-29 04:59:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 111449 states and 141741 transitions. [2023-11-29 04:59:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-29 04:59:26,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:27,000 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-11-29 04:59:27,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 04:59:27,000 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:59:27,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -502624270, now seen corresponding path program 1 times [2023-11-29 04:59:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:59:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520876935] [2023-11-29 04:59:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:59:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:59:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:59:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:59:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:59:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:59:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:59:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 04:59:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 04:59:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-29 04:59:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:59:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520876935] [2023-11-29 04:59:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520876935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:59:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217207890] [2023-11-29 04:59:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:27,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:59:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:59:27,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:59:27,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:59:27,121 INFO L87 Difference]: Start difference. First operand 111449 states and 141741 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-29 04:59:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:35,148 INFO L93 Difference]: Finished difference Result 234622 states and 297198 transitions. [2023-11-29 04:59:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:59:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 167 [2023-11-29 04:59:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:35,432 INFO L225 Difference]: With dead ends: 234622 [2023-11-29 04:59:35,432 INFO L226 Difference]: Without dead ends: 127904 [2023-11-29 04:59:35,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:59:35,548 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 932 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:35,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 452 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:59:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127904 states. [2023-11-29 04:59:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127904 to 105005. [2023-11-29 04:59:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105005 states, 90649 states have (on average 1.2229478538097498) internal successors, (110859), 92202 states have internal predecessors, (110859), 7202 states have call successors, (7202), 5276 states have call predecessors, (7202), 7153 states have return successors, (14332), 7528 states have call predecessors, (14332), 7202 states have call successors, (14332) [2023-11-29 04:59:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105005 states to 105005 states and 132393 transitions. [2023-11-29 04:59:42,383 INFO L78 Accepts]: Start accepts. Automaton has 105005 states and 132393 transitions. Word has length 167 [2023-11-29 04:59:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:42,384 INFO L495 AbstractCegarLoop]: Abstraction has 105005 states and 132393 transitions. [2023-11-29 04:59:42,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-29 04:59:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 105005 states and 132393 transitions. [2023-11-29 04:59:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-11-29 04:59:42,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:42,417 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:42,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 04:59:42,417 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:59:42,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1686829601, now seen corresponding path program 1 times [2023-11-29 04:59:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:59:42,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663912679] [2023-11-29 04:59:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:59:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:59:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:59:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:59:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:59:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:59:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:59:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:59:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 04:59:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 04:59:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 32 proven. 22 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-29 04:59:42,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:59:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663912679] [2023-11-29 04:59:42,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663912679] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:59:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235794706] [2023-11-29 04:59:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:42,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:59:42,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:59:42,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:59:42,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:59:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:42,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:59:42,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-29 04:59:42,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:42,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235794706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:42,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:59:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-29 04:59:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589844504] [2023-11-29 04:59:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:42,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:59:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:59:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:59:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:59:42,727 INFO L87 Difference]: Start difference. First operand 105005 states and 132393 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-29 04:59:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:47,716 INFO L93 Difference]: Finished difference Result 172747 states and 221421 transitions. [2023-11-29 04:59:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:59:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 198 [2023-11-29 04:59:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:47,893 INFO L225 Difference]: With dead ends: 172747 [2023-11-29 04:59:47,893 INFO L226 Difference]: Without dead ends: 87042 [2023-11-29 04:59:47,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:59:47,990 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 140 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:47,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 468 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:59:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87042 states. [2023-11-29 04:59:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87042 to 85349. [2023-11-29 04:59:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85349 states, 73879 states have (on average 1.203806223690088) internal successors, (88936), 75150 states have internal predecessors, (88936), 5762 states have call successors, (5762), 4214 states have call predecessors, (5762), 5707 states have return successors, (10843), 5986 states have call predecessors, (10843), 5762 states have call successors, (10843) [2023-11-29 04:59:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85349 states to 85349 states and 105541 transitions. [2023-11-29 04:59:52,899 INFO L78 Accepts]: Start accepts. Automaton has 85349 states and 105541 transitions. Word has length 198 [2023-11-29 04:59:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:52,899 INFO L495 AbstractCegarLoop]: Abstraction has 85349 states and 105541 transitions. [2023-11-29 04:59:52,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-29 04:59:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 85349 states and 105541 transitions. [2023-11-29 04:59:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-29 04:59:52,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:52,926 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:52,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:59:53,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 04:59:53,127 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:59:53,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1537850711, now seen corresponding path program 1 times [2023-11-29 04:59:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:59:53,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591698473] [2023-11-29 04:59:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:59:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 04:59:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 04:59:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:59:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 04:59:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 04:59:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:59:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:59:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 04:59:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 04:59:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 04:59:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-11-29 04:59:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:59:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591698473] [2023-11-29 04:59:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591698473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:59:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062370267] [2023-11-29 04:59:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:53,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:59:53,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:59:53,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:59:53,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:59:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:53,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:59:53,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 04:59:53,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062370267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:53,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:59:53,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-29 04:59:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091065990] [2023-11-29 04:59:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:53,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:59:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:59:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:59:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:59:53,436 INFO L87 Difference]: Start difference. First operand 85349 states and 105541 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-29 04:59:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:58,249 INFO L93 Difference]: Finished difference Result 137050 states and 173227 transitions. [2023-11-29 04:59:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:59:58,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 200 [2023-11-29 04:59:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:58,425 INFO L225 Difference]: With dead ends: 137050 [2023-11-29 04:59:58,425 INFO L226 Difference]: Without dead ends: 84065 [2023-11-29 04:59:58,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:59:58,496 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 139 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:58,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 480 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:59:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84065 states. [2023-11-29 05:00:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84065 to 83835. [2023-11-29 05:00:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83835 states, 72365 states have (on average 1.191100670213501) internal successors, (86194), 73636 states have internal predecessors, (86194), 5762 states have call successors, (5762), 4214 states have call predecessors, (5762), 5707 states have return successors, (10843), 5986 states have call predecessors, (10843), 5762 states have call successors, (10843) [2023-11-29 05:00:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83835 states to 83835 states and 102799 transitions. [2023-11-29 05:00:03,848 INFO L78 Accepts]: Start accepts. Automaton has 83835 states and 102799 transitions. Word has length 200 [2023-11-29 05:00:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:00:03,848 INFO L495 AbstractCegarLoop]: Abstraction has 83835 states and 102799 transitions. [2023-11-29 05:00:03,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-29 05:00:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 83835 states and 102799 transitions. [2023-11-29 05:00:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2023-11-29 05:00:03,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:00:03,877 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:00:03,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:00:04,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:00:04,078 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:00:04,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:00:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1180173767, now seen corresponding path program 1 times [2023-11-29 05:00:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:00:04,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280094389] [2023-11-29 05:00:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:00:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:00:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:00:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:00:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:00:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:00:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:00:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:00:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:00:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:00:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 05:00:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 57 proven. 22 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-29 05:00:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:00:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280094389] [2023-11-29 05:00:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280094389] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:00:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156204558] [2023-11-29 05:00:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:00:04,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:00:04,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:00:04,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:00:04,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:00:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:04,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:00:04,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:00:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 05:00:04,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:00:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156204558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:00:04,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:00:04,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-29 05:00:04,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589143021] [2023-11-29 05:00:04,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:00:04,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:00:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:00:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:00:04,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:00:04,388 INFO L87 Difference]: Start difference. First operand 83835 states and 102799 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:00:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:00:11,253 INFO L93 Difference]: Finished difference Result 196152 states and 244446 transitions. [2023-11-29 05:00:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:00:11,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 202 [2023-11-29 05:00:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:00:11,517 INFO L225 Difference]: With dead ends: 196152 [2023-11-29 05:00:11,517 INFO L226 Difference]: Without dead ends: 112078 [2023-11-29 05:00:11,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:00:11,732 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 163 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:00:11,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 436 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:00:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112078 states. [2023-11-29 05:00:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112078 to 111454. [2023-11-29 05:00:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111454 states, 96281 states have (on average 1.1708125175268225) internal successors, (112727), 97895 states have internal predecessors, (112727), 7514 states have call successors, (7514), 5694 states have call predecessors, (7514), 7658 states have return successors, (15197), 7868 states have call predecessors, (15197), 7514 states have call successors, (15197) [2023-11-29 05:00:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111454 states to 111454 states and 135438 transitions. [2023-11-29 05:00:18,765 INFO L78 Accepts]: Start accepts. Automaton has 111454 states and 135438 transitions. Word has length 202 [2023-11-29 05:00:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:00:18,766 INFO L495 AbstractCegarLoop]: Abstraction has 111454 states and 135438 transitions. [2023-11-29 05:00:18,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:00:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 111454 states and 135438 transitions. [2023-11-29 05:00:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-11-29 05:00:18,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:00:18,806 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:00:18,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:00:19,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:00:19,007 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:00:19,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:00:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash -115042767, now seen corresponding path program 1 times [2023-11-29 05:00:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:00:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85349749] [2023-11-29 05:00:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:00:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:00:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:00:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:00:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:00:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:00:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:00:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:00:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:00:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:00:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-29 05:00:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 50 proven. 51 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 05:00:19,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:00:19,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85349749] [2023-11-29 05:00:19,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85349749] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:00:19,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139215395] [2023-11-29 05:00:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:00:19,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:00:19,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:00:19,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:00:19,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:00:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:19,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:00:19,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:00:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 05:00:19,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:00:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139215395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:00:19,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:00:19,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-29 05:00:19,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546511864] [2023-11-29 05:00:19,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:00:19,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:00:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:00:19,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:00:19,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:00:19,332 INFO L87 Difference]: Start difference. First operand 111454 states and 135438 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 05:00:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:00:23,044 INFO L93 Difference]: Finished difference Result 173414 states and 212930 transitions. [2023-11-29 05:00:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:00:23,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 204 [2023-11-29 05:00:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:00:23,286 INFO L225 Difference]: With dead ends: 173414 [2023-11-29 05:00:23,286 INFO L226 Difference]: Without dead ends: 68517 [2023-11-29 05:00:23,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:00:23,370 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 106 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:00:23,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 415 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:00:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68517 states. [2023-11-29 05:00:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68517 to 68429. [2023-11-29 05:00:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68429 states, 59371 states have (on average 1.1593202068349868) internal successors, (68830), 60434 states have internal predecessors, (68830), 4372 states have call successors, (4372), 3348 states have call predecessors, (4372), 4685 states have return successors, (8060), 4650 states have call predecessors, (8060), 4372 states have call successors, (8060) [2023-11-29 05:00:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68429 states to 68429 states and 81262 transitions. [2023-11-29 05:00:26,920 INFO L78 Accepts]: Start accepts. Automaton has 68429 states and 81262 transitions. Word has length 204 [2023-11-29 05:00:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:00:26,920 INFO L495 AbstractCegarLoop]: Abstraction has 68429 states and 81262 transitions. [2023-11-29 05:00:26,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 05:00:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 68429 states and 81262 transitions. [2023-11-29 05:00:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-11-29 05:00:26,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:00:26,943 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:00:26,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 05:00:27,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:00:27,144 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:00:27,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:00:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1681321583, now seen corresponding path program 2 times [2023-11-29 05:00:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:00:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078712240] [2023-11-29 05:00:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:00:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:00:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:00:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:00:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:00:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:00:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:00:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:00:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:00:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:00:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-29 05:00:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:00:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:00:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 46 proven. 16 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-29 05:00:27,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:00:27,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078712240] [2023-11-29 05:00:27,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078712240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:00:27,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243055597] [2023-11-29 05:00:27,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:00:27,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:00:27,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:00:27,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:00:27,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:00:27,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:00:27,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:00:27,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:00:27,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:00:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 05:00:27,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:00:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243055597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:00:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:00:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-29 05:00:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195610351] [2023-11-29 05:00:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:00:27,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:00:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:00:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:00:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:00:27,500 INFO L87 Difference]: Start difference. First operand 68429 states and 81262 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 05:00:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:00:29,351 INFO L93 Difference]: Finished difference Result 98833 states and 119281 transitions. [2023-11-29 05:00:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:00:29,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 204 [2023-11-29 05:00:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:00:29,406 INFO L225 Difference]: With dead ends: 98833 [2023-11-29 05:00:29,406 INFO L226 Difference]: Without dead ends: 32763 [2023-11-29 05:00:29,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:00:29,463 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 138 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:00:29,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 207 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:00:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32763 states. [2023-11-29 05:00:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32763 to 31204. [2023-11-29 05:00:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31204 states, 27066 states have (on average 1.1366659277322102) internal successors, (30765), 27406 states have internal predecessors, (30765), 2112 states have call successors, (2112), 1582 states have call predecessors, (2112), 2025 states have return successors, (3254), 2219 states have call predecessors, (3254), 2112 states have call successors, (3254) [2023-11-29 05:00:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31204 states to 31204 states and 36131 transitions. [2023-11-29 05:00:31,613 INFO L78 Accepts]: Start accepts. Automaton has 31204 states and 36131 transitions. Word has length 204 [2023-11-29 05:00:31,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:00:31,613 INFO L495 AbstractCegarLoop]: Abstraction has 31204 states and 36131 transitions. [2023-11-29 05:00:31,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 05:00:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 31204 states and 36131 transitions. [2023-11-29 05:00:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-11-29 05:00:31,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:00:31,633 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:00:31,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:00:31,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-29 05:00:31,834 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:00:31,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:00:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1873477273, now seen corresponding path program 1 times [2023-11-29 05:00:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:00:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498688232] [2023-11-29 05:00:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:00:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:00:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:00:31,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:00:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:00:31,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:00:31,931 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:00:31,932 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:00:31,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 05:00:31,938 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, 1, 1, 1, 1] [2023-11-29 05:00:31,942 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:00:32,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:00:32,036 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:00:32,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:00:32 BoogieIcfgContainer [2023-11-29 05:00:32,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:00:32,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:00:32,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:00:32,089 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:00:32,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:57:24" (3/4) ... [2023-11-29 05:00:32,091 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:00:32,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:00:32,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:00:32,246 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:00:32,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:00:32,247 INFO L158 Benchmark]: Toolchain (without parser) took 188372.61ms. Allocated memory was 142.6MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 106.1MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 4.6GB. Max. memory is 16.1GB. [2023-11-29 05:00:32,247 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:00:32,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.20ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:00:32,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.02ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:00:32,248 INFO L158 Benchmark]: Boogie Preprocessor took 45.18ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 86.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:00:32,248 INFO L158 Benchmark]: RCFGBuilder took 539.16ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 102.6MB in the end (delta: -16.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2023-11-29 05:00:32,249 INFO L158 Benchmark]: TraceAbstraction took 187293.50ms. Allocated memory was 142.6MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 101.5MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 4.5GB. Max. memory is 16.1GB. [2023-11-29 05:00:32,249 INFO L158 Benchmark]: Witness Printer took 157.43ms. Allocated memory is still 9.6GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:00:32,250 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.18ms. Allocated memory is still 98.6MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.20ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.02ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.18ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 86.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 539.16ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 102.6MB in the end (delta: -16.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 187293.50ms. Allocated memory was 142.6MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 101.5MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 4.5GB. Max. memory is 16.1GB. * Witness Printer took 157.43ms. Allocated memory is still 9.6GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L697] int __retres1 ; [L701] CALL init_model() [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 [L701] RET init_model() [L702] CALL start_simulation() [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L645] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L646] CALL init_threads() [L281] COND TRUE m_i == 1 [L282] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L646] RET init_threads() [L647] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L418] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L423] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L428] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L433] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L438] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L443] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L448] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L647] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L648] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0] [L648] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L649] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L461] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L466] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L471] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L476] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L481] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L486] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L491] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L649] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L652] COND TRUE 1 [L655] kernel_st = 1 [L656] CALL eval() [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0] [L351-L362] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE, EXPR \read(tmp_ndt_2) [L370] EXPR t1_st = 1 [L371] CALL, EXPR transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L371] RET, EXPR transmit1() [L365-L376] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE, EXPR \read(tmp_ndt_3) [L384] EXPR t2_st = 1 [L385] CALL, EXPR transmit2() [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=0] [L385] RET, EXPR transmit2() [L379-L390] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] EXPR tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE, EXPR \read(tmp_ndt_4) [L398] EXPR t3_st = 1 [L399] CALL, EXPR transmit3() [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 [L177] t3_pc = 1 [L178] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L399] RET, EXPR transmit3() [L393-L404] { int tmp_ndt_4; tmp_ndt_4 = __VERIFIER_nondet_int(); if (tmp_ndt_4) { { t3_st = 1; transmit3(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE, EXPR \read(tmp_ndt_1) [L356] EXPR m_st = 1 [L357] CALL, EXPR master() [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 [L67] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L68] CALL immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0] [L548] RET activate_threads() VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L68] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L357] RET, EXPR master() [L351-L362] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE, EXPR \read(tmp_ndt_2) [L370] EXPR t1_st = 1 [L371] CALL, EXPR transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 [L113] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L114] CALL immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0] [L548] RET activate_threads() VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L114] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L371] RET, EXPR transmit1() [L365-L376] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE, EXPR \read(tmp_ndt_3) [L384] EXPR t2_st = 1 [L385] CALL, EXPR transmit2() [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 [L148] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L149] CALL immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0] [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0] [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0] [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1] [L548] RET activate_threads() VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0] [L149] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0] [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=0] [L385] RET, EXPR transmit2() [L379-L390] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=0, tmp=1] [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 [L183] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 187.1s, OverallIterations: 36, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 102.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18862 SdHoareTripleChecker+Valid, 19.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18535 mSDsluCounter, 15740 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10573 mSDsCounter, 2418 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22095 IncrementalHoareTripleChecker+Invalid, 24513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2418 mSolverCounterUnsat, 5167 mSDtfsCounter, 22095 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1996 GetRequests, 1605 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114905occurred in iteration=28, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 144110 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 4751 NumberOfCodeBlocks, 4751 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4505 ConstructedInterpolants, 0 QuantifiedInterpolants, 9710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3329 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 40 InterpolantComputations, 35 PerfectInterpolantSequences, 1773/1897 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-29 05:00:32,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76f8e43e-132b-4453-a529-f26b69284248/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE