./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.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_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme --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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:50:12,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:50:12,333 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:50:12,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:50:12,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:50:12,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:50:12,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:50:12,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:50:12,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:50:12,391 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:50:12,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:50:12,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:50:12,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:50:12,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:50:12,395 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:50:12,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:50:12,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:50:12,397 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:50:12,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:50:12,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:50:12,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:50:12,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:50:12,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:50:12,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:50:12,402 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:50:12,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:50:12,403 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:50:12,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:50:12,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:50:12,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:50:12,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:50:12,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:50:12,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:50:12,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:50:12,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:50:12,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:50:12,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:50:12,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:50:12,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:50:12,421 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:50:12,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:50:12,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:50:12,422 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_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/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_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2023-11-26 10:50:12,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:50:12,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:50:12,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:50:12,786 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:50:12,787 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:50:12,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-11-26 10:50:15,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:50:16,178 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:50:16,179 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-11-26 10:50:16,194 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/data/fa8314355/89bff1d7636f4731bc554c5f98b65728/FLAGc2a916d92 [2023-11-26 10:50:16,215 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/data/fa8314355/89bff1d7636f4731bc554c5f98b65728 [2023-11-26 10:50:16,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:50:16,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:50:16,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:50:16,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:50:16,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:50:16,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771e55c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16, skipping insertion in model container [2023-11-26 10:50:16,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,275 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:50:16,444 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_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-11-26 10:50:16,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:50:16,523 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:50:16,533 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_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-11-26 10:50:16,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:50:16,583 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:50:16,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16 WrapperNode [2023-11-26 10:50:16,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:50:16,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:50:16,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:50:16,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:50:16,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,634 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 269 [2023-11-26 10:50:16,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:50:16,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:50:16,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:50:16,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:50:16,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,665 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-26 10:50:16,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:50:16,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:50:16,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:50:16,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:50:16,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (1/1) ... [2023-11-26 10:50:16,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:50:16,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:16,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:50:16,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:50:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:50:16,761 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-26 10:50:16,762 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-26 10:50:16,762 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-26 10:50:16,762 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-26 10:50:16,762 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-26 10:50:16,763 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-26 10:50:16,763 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-26 10:50:16,763 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-26 10:50:16,763 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-26 10:50:16,763 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-26 10:50:16,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:50:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-26 10:50:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-26 10:50:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:50:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:50:16,865 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:50:16,867 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:50:17,306 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:50:17,354 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:50:17,354 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-26 10:50:17,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:17 BoogieIcfgContainer [2023-11-26 10:50:17,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:50:17,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:50:17,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:50:17,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:50:17,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:50:16" (1/3) ... [2023-11-26 10:50:17,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f8a8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:50:17, skipping insertion in model container [2023-11-26 10:50:17,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:50:16" (2/3) ... [2023-11-26 10:50:17,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f8a8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:50:17, skipping insertion in model container [2023-11-26 10:50:17,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:17" (3/3) ... [2023-11-26 10:50:17,365 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2023-11-26 10:50:17,385 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:50:17,386 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:50:17,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:50:17,449 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;@736172a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:50:17,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:50:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 92 states have internal predecessors, (149), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-26 10:50:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:50:17,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:17,465 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] [2023-11-26 10:50:17,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:17,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1884876222, now seen corresponding path program 1 times [2023-11-26 10:50:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:17,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144104014] [2023-11-26 10:50:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:17,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:17,911 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-26 10:50:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:17,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144104014] [2023-11-26 10:50:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144104014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:17,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973207469] [2023-11-26 10:50:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:17,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:17,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:17,956 INFO L87 Difference]: Start difference. First operand has 113 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 92 states have internal predecessors, (149), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 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-26 10:50:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:18,645 INFO L93 Difference]: Finished difference Result 248 states and 396 transitions. [2023-11-26 10:50:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:50:18,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 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 59 [2023-11-26 10:50:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:18,669 INFO L225 Difference]: With dead ends: 248 [2023-11-26 10:50:18,669 INFO L226 Difference]: Without dead ends: 139 [2023-11-26 10:50:18,674 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-26 10:50:18,678 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 252 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:18,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 201 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:50:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-26 10:50:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2023-11-26 10:50:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 90 states have internal predecessors, (133), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-26 10:50:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-26 10:50:18,746 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 59 [2023-11-26 10:50:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:18,747 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-26 10:50:18,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 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-26 10:50:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-26 10:50:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:50:18,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:18,752 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] [2023-11-26 10:50:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:50:18,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:18,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:18,754 INFO L85 PathProgramCache]: Analyzing trace with hash 871751044, now seen corresponding path program 1 times [2023-11-26 10:50:18,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141920356] [2023-11-26 10:50:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:18,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:19,117 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-26 10:50:19,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141920356] [2023-11-26 10:50:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141920356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:50:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930409716] [2023-11-26 10:50:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:19,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:50:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:50:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:19,122 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-26 10:50:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:19,940 INFO L93 Difference]: Finished difference Result 371 states and 562 transitions. [2023-11-26 10:50:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:50:19,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 59 [2023-11-26 10:50:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:19,957 INFO L225 Difference]: With dead ends: 371 [2023-11-26 10:50:19,957 INFO L226 Difference]: Without dead ends: 268 [2023-11-26 10:50:19,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:50:19,966 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 360 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:19,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 328 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 10:50:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-26 10:50:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 213. [2023-11-26 10:50:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 176 states have internal predecessors, (260), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-26 10:50:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 313 transitions. [2023-11-26 10:50:20,053 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 313 transitions. Word has length 59 [2023-11-26 10:50:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:20,054 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 313 transitions. [2023-11-26 10:50:20,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-26 10:50:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 313 transitions. [2023-11-26 10:50:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:50:20,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:20,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:50:20,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:50:20,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:20,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -549214809, now seen corresponding path program 1 times [2023-11-26 10:50:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155291506] [2023-11-26 10:50:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:20,409 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-26 10:50:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155291506] [2023-11-26 10:50:20,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155291506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:20,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:20,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:20,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643681971] [2023-11-26 10:50:20,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:20,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:20,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:20,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:20,416 INFO L87 Difference]: Start difference. First operand 213 states and 313 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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-26 10:50:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:21,617 INFO L93 Difference]: Finished difference Result 635 states and 942 transitions. [2023-11-26 10:50:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 10:50:21,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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 59 [2023-11-26 10:50:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:21,623 INFO L225 Difference]: With dead ends: 635 [2023-11-26 10:50:21,624 INFO L226 Difference]: Without dead ends: 430 [2023-11-26 10:50:21,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-26 10:50:21,627 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 374 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:21,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 608 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 10:50:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-11-26 10:50:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 309. [2023-11-26 10:50:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 253 states have (on average 1.482213438735178) internal successors, (375), 256 states have internal predecessors, (375), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2023-11-26 10:50:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2023-11-26 10:50:21,686 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 59 [2023-11-26 10:50:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:21,688 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2023-11-26 10:50:21,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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-26 10:50:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2023-11-26 10:50:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:50:21,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:21,691 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] [2023-11-26 10:50:21,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:50:21,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:21,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1389947237, now seen corresponding path program 1 times [2023-11-26 10:50:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000225191] [2023-11-26 10:50:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:21,894 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-26 10:50:21,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:21,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000225191] [2023-11-26 10:50:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000225191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:21,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:21,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:21,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691964851] [2023-11-26 10:50:21,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:21,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:21,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:21,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:21,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:21,898 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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-26 10:50:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:23,003 INFO L93 Difference]: Finished difference Result 973 states and 1433 transitions. [2023-11-26 10:50:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 10:50:23,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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 59 [2023-11-26 10:50:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:23,010 INFO L225 Difference]: With dead ends: 973 [2023-11-26 10:50:23,010 INFO L226 Difference]: Without dead ends: 672 [2023-11-26 10:50:23,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-26 10:50:23,013 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 378 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:23,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 606 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 10:50:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2023-11-26 10:50:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 502. [2023-11-26 10:50:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 412 states have (on average 1.470873786407767) internal successors, (606), 417 states have internal predecessors, (606), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2023-11-26 10:50:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 729 transitions. [2023-11-26 10:50:23,077 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 729 transitions. Word has length 59 [2023-11-26 10:50:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:23,078 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 729 transitions. [2023-11-26 10:50:23,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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-26 10:50:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 729 transitions. [2023-11-26 10:50:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:50:23,080 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:23,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] [2023-11-26 10:50:23,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:50:23,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:23,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1036858855, now seen corresponding path program 1 times [2023-11-26 10:50:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581961856] [2023-11-26 10:50:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,215 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-26 10:50:23,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:23,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581961856] [2023-11-26 10:50:23,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581961856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:23,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:23,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627964408] [2023-11-26 10:50:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:23,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:23,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:23,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:23,234 INFO L87 Difference]: Start difference. First operand 502 states and 729 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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-26 10:50:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:23,738 INFO L93 Difference]: Finished difference Result 1118 states and 1644 transitions. [2023-11-26 10:50:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:50:23,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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 59 [2023-11-26 10:50:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:23,744 INFO L225 Difference]: With dead ends: 1118 [2023-11-26 10:50:23,744 INFO L226 Difference]: Without dead ends: 624 [2023-11-26 10:50:23,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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-26 10:50:23,747 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 278 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:23,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 295 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:50:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-11-26 10:50:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 502. [2023-11-26 10:50:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 412 states have (on average 1.4587378640776698) internal successors, (601), 417 states have internal predecessors, (601), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2023-11-26 10:50:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 724 transitions. [2023-11-26 10:50:23,804 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 724 transitions. Word has length 59 [2023-11-26 10:50:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:23,804 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 724 transitions. [2023-11-26 10:50:23,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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-26 10:50:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 724 transitions. [2023-11-26 10:50:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:50:23,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:23,806 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] [2023-11-26 10:50:23,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:50:23,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:23,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1930345193, now seen corresponding path program 1 times [2023-11-26 10:50:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971002538] [2023-11-26 10:50:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:23,934 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-26 10:50:23,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:23,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971002538] [2023-11-26 10:50:23,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971002538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:23,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:23,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:50:23,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15638413] [2023-11-26 10:50:23,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:23,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:50:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:50:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:23,937 INFO L87 Difference]: Start difference. First operand 502 states and 724 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-26 10:50:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:24,481 INFO L93 Difference]: Finished difference Result 1091 states and 1601 transitions. [2023-11-26 10:50:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:50:24,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 59 [2023-11-26 10:50:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:24,486 INFO L225 Difference]: With dead ends: 1091 [2023-11-26 10:50:24,486 INFO L226 Difference]: Without dead ends: 598 [2023-11-26 10:50:24,489 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-26 10:50:24,490 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 158 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:24,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 353 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:50:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2023-11-26 10:50:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 504. [2023-11-26 10:50:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 414 states have (on average 1.4468599033816425) internal successors, (599), 419 states have internal predecessors, (599), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2023-11-26 10:50:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 722 transitions. [2023-11-26 10:50:24,541 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 722 transitions. Word has length 59 [2023-11-26 10:50:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:24,541 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 722 transitions. [2023-11-26 10:50:24,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-26 10:50:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 722 transitions. [2023-11-26 10:50:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:50:24,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:24,544 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] [2023-11-26 10:50:24,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:50:24,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:24,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1705090581, now seen corresponding path program 1 times [2023-11-26 10:50:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:24,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326459176] [2023-11-26 10:50:24,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:24,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:24,646 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-26 10:50:24,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:24,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326459176] [2023-11-26 10:50:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326459176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:24,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:50:24,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223225495] [2023-11-26 10:50:24,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:24,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:50:24,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:50:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:24,650 INFO L87 Difference]: Start difference. First operand 504 states and 722 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-26 10:50:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:25,168 INFO L93 Difference]: Finished difference Result 1113 states and 1625 transitions. [2023-11-26 10:50:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:50:25,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 59 [2023-11-26 10:50:25,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:25,174 INFO L225 Difference]: With dead ends: 1113 [2023-11-26 10:50:25,174 INFO L226 Difference]: Without dead ends: 618 [2023-11-26 10:50:25,176 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-26 10:50:25,178 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 161 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:25,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 352 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:50:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2023-11-26 10:50:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 514. [2023-11-26 10:50:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 424 states have (on average 1.4363207547169812) internal successors, (609), 429 states have internal predecessors, (609), 55 states have call successors, (55), 30 states have call predecessors, (55), 34 states have return successors, (68), 58 states have call predecessors, (68), 55 states have call successors, (68) [2023-11-26 10:50:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 732 transitions. [2023-11-26 10:50:25,245 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 732 transitions. Word has length 59 [2023-11-26 10:50:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:25,246 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 732 transitions. [2023-11-26 10:50:25,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-26 10:50:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2023-11-26 10:50:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:50:25,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:25,248 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] [2023-11-26 10:50:25,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:50:25,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:25,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1430330967, now seen corresponding path program 1 times [2023-11-26 10:50:25,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:25,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422671672] [2023-11-26 10:50:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:25,408 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-26 10:50:25,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422671672] [2023-11-26 10:50:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422671672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:25,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974653084] [2023-11-26 10:50:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:25,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:25,411 INFO L87 Difference]: Start difference. First operand 514 states and 732 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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-26 10:50:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:26,773 INFO L93 Difference]: Finished difference Result 2774 states and 4122 transitions. [2023-11-26 10:50:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 10:50:26,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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 59 [2023-11-26 10:50:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:26,791 INFO L225 Difference]: With dead ends: 2774 [2023-11-26 10:50:26,792 INFO L226 Difference]: Without dead ends: 2269 [2023-11-26 10:50:26,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 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-26 10:50:26,797 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 912 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:26,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 488 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 10:50:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2023-11-26 10:50:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1449. [2023-11-26 10:50:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1194 states have (on average 1.4288107202680067) internal successors, (1706), 1212 states have internal predecessors, (1706), 152 states have call successors, (152), 90 states have call predecessors, (152), 102 states have return successors, (201), 150 states have call predecessors, (201), 152 states have call successors, (201) [2023-11-26 10:50:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2059 transitions. [2023-11-26 10:50:26,964 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2059 transitions. Word has length 59 [2023-11-26 10:50:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:26,965 INFO L495 AbstractCegarLoop]: Abstraction has 1449 states and 2059 transitions. [2023-11-26 10:50:26,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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-26 10:50:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2059 transitions. [2023-11-26 10:50:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 10:50:26,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:26,971 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:26,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:50:26,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:26,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1697273882, now seen corresponding path program 1 times [2023-11-26 10:50:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163063347] [2023-11-26 10:50:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:27,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:27,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-26 10:50:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-26 10:50:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163063347] [2023-11-26 10:50:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163063347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:50:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39328319] [2023-11-26 10:50:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:27,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:50:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:50:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:27,137 INFO L87 Difference]: Start difference. First operand 1449 states and 2059 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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-26 10:50:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:27,711 INFO L93 Difference]: Finished difference Result 3192 states and 4643 transitions. [2023-11-26 10:50:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:50:27,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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-26 10:50:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:27,726 INFO L225 Difference]: With dead ends: 3192 [2023-11-26 10:50:27,726 INFO L226 Difference]: Without dead ends: 1752 [2023-11-26 10:50:27,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 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-26 10:50:27,734 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 146 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:27,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 347 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:50:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2023-11-26 10:50:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1469. [2023-11-26 10:50:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1214 states have (on average 1.4176276771004943) internal successors, (1721), 1232 states have internal predecessors, (1721), 152 states have call successors, (152), 90 states have call predecessors, (152), 102 states have return successors, (201), 150 states have call predecessors, (201), 152 states have call successors, (201) [2023-11-26 10:50:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2074 transitions. [2023-11-26 10:50:27,873 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2074 transitions. Word has length 75 [2023-11-26 10:50:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:27,873 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 2074 transitions. [2023-11-26 10:50:27,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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-26 10:50:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2074 transitions. [2023-11-26 10:50:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 10:50:27,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:27,879 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:27,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:50:27,880 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:27,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 799880604, now seen corresponding path program 1 times [2023-11-26 10:50:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:27,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99250341] [2023-11-26 10:50:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:28,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:28,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:28,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:28,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:28,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-26 10:50:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-26 10:50:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99250341] [2023-11-26 10:50:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99250341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:28,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:28,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:50:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484508429] [2023-11-26 10:50:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:28,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:50:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:28,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:50:28,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:50:28,135 INFO L87 Difference]: Start difference. First operand 1469 states and 2074 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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-26 10:50:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:29,213 INFO L93 Difference]: Finished difference Result 2415 states and 3424 transitions. [2023-11-26 10:50:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 10:50:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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-26 10:50:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:29,225 INFO L225 Difference]: With dead ends: 2415 [2023-11-26 10:50:29,225 INFO L226 Difference]: Without dead ends: 1508 [2023-11-26 10:50:29,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-11-26 10:50:29,230 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 500 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:29,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 452 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 10:50:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2023-11-26 10:50:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1163. [2023-11-26 10:50:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 961 states have (on average 1.4079084287200831) internal successors, (1353), 972 states have internal predecessors, (1353), 123 states have call successors, (123), 72 states have call predecessors, (123), 78 states have return successors, (146), 120 states have call predecessors, (146), 123 states have call successors, (146) [2023-11-26 10:50:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1622 transitions. [2023-11-26 10:50:29,369 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1622 transitions. Word has length 75 [2023-11-26 10:50:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:29,370 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1622 transitions. [2023-11-26 10:50:29,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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-26 10:50:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1622 transitions. [2023-11-26 10:50:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 10:50:29,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:29,372 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:29,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:50:29,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:29,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -229478694, now seen corresponding path program 1 times [2023-11-26 10:50:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:29,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455306678] [2023-11-26 10:50:29,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:29,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-26 10:50:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-26 10:50:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455306678] [2023-11-26 10:50:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455306678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:50:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374131135] [2023-11-26 10:50:29,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:29,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:50:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:29,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:50:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:50:29,537 INFO L87 Difference]: Start difference. First operand 1163 states and 1622 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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-26 10:50:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:30,574 INFO L93 Difference]: Finished difference Result 2049 states and 2886 transitions. [2023-11-26 10:50:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 10:50:30,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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-26 10:50:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:30,584 INFO L225 Difference]: With dead ends: 2049 [2023-11-26 10:50:30,584 INFO L226 Difference]: Without dead ends: 1166 [2023-11-26 10:50:30,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-11-26 10:50:30,588 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 597 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:30,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 398 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 10:50:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-11-26 10:50:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 881. [2023-11-26 10:50:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 729 states have (on average 1.412894375857339) internal successors, (1030), 736 states have internal predecessors, (1030), 94 states have call successors, (94), 54 states have call predecessors, (94), 57 states have return successors, (107), 91 states have call predecessors, (107), 94 states have call successors, (107) [2023-11-26 10:50:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1231 transitions. [2023-11-26 10:50:30,672 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1231 transitions. Word has length 75 [2023-11-26 10:50:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:30,673 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1231 transitions. [2023-11-26 10:50:30,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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-26 10:50:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1231 transitions. [2023-11-26 10:50:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 10:50:30,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:30,675 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:30,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:50:30,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:30,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash 430052828, now seen corresponding path program 1 times [2023-11-26 10:50:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273491185] [2023-11-26 10:50:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:30,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:30,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-26 10:50:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-26 10:50:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273491185] [2023-11-26 10:50:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273491185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:30,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132308496] [2023-11-26 10:50:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:30,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:30,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:30,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:30,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:30,801 INFO L87 Difference]: Start difference. First operand 881 states and 1231 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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-26 10:50:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:31,404 INFO L93 Difference]: Finished difference Result 2304 states and 3200 transitions. [2023-11-26 10:50:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:50:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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-26 10:50:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:31,414 INFO L225 Difference]: With dead ends: 2304 [2023-11-26 10:50:31,414 INFO L226 Difference]: Without dead ends: 1433 [2023-11-26 10:50:31,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-26 10:50:31,423 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 490 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:31,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 251 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:50:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2023-11-26 10:50:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1090. [2023-11-26 10:50:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 917 states have (on average 1.3500545256270446) internal successors, (1238), 924 states have internal predecessors, (1238), 100 states have call successors, (100), 69 states have call predecessors, (100), 72 states have return successors, (128), 97 states have call predecessors, (128), 100 states have call successors, (128) [2023-11-26 10:50:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1466 transitions. [2023-11-26 10:50:31,520 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1466 transitions. Word has length 75 [2023-11-26 10:50:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:31,521 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1466 transitions. [2023-11-26 10:50:31,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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-26 10:50:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1466 transitions. [2023-11-26 10:50:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-26 10:50:31,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:31,523 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:31,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:50:31,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:31,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:31,527 INFO L85 PathProgramCache]: Analyzing trace with hash -413952674, now seen corresponding path program 1 times [2023-11-26 10:50:31,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:31,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676697279] [2023-11-26 10:50:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-26 10:50:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:50:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676697279] [2023-11-26 10:50:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676697279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:31,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740564451] [2023-11-26 10:50:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:31,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:31,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:31,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:31,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:50:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:31,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 10:50:31,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:31,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:50:31,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740564451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:31,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:50:31,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-26 10:50:31,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178665430] [2023-11-26 10:50:31,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:31,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:31,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:31,824 INFO L87 Difference]: Start difference. First operand 1090 states and 1466 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:50:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:31,963 INFO L93 Difference]: Finished difference Result 2526 states and 3457 transitions. [2023-11-26 10:50:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:31,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2023-11-26 10:50:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:31,975 INFO L225 Difference]: With dead ends: 2526 [2023-11-26 10:50:31,975 INFO L226 Difference]: Without dead ends: 1792 [2023-11-26 10:50:32,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:32,004 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 121 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:32,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 357 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2023-11-26 10:50:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2023-11-26 10:50:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1510 states have (on average 1.343046357615894) internal successors, (2028), 1519 states have internal predecessors, (2028), 162 states have call successors, (162), 114 states have call predecessors, (162), 119 states have return successors, (235), 159 states have call predecessors, (235), 162 states have call successors, (235) [2023-11-26 10:50:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2425 transitions. [2023-11-26 10:50:32,140 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2425 transitions. Word has length 75 [2023-11-26 10:50:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:32,141 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 2425 transitions. [2023-11-26 10:50:32,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:50:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2425 transitions. [2023-11-26 10:50:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-26 10:50:32,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:32,143 INFO L195 NwaCegarLoop]: trace histogram [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-26 10:50:32,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:32,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-26 10:50:32,349 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:32,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1163334948, now seen corresponding path program 1 times [2023-11-26 10:50:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282651398] [2023-11-26 10:50:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:32,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:32,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:32,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-26 10:50:32,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:32,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282651398] [2023-11-26 10:50:32,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282651398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:32,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:32,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:50:32,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469220625] [2023-11-26 10:50:32,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:32,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:50:32,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:32,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:50:32,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:32,556 INFO L87 Difference]: Start difference. First operand 1792 states and 2425 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-26 10:50:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:33,372 INFO L93 Difference]: Finished difference Result 5580 states and 7620 transitions. [2023-11-26 10:50:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:50:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2023-11-26 10:50:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:33,399 INFO L225 Difference]: With dead ends: 5580 [2023-11-26 10:50:33,399 INFO L226 Difference]: Without dead ends: 3798 [2023-11-26 10:50:33,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-11-26 10:50:33,407 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 474 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:33,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 377 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:50:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2023-11-26 10:50:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3318. [2023-11-26 10:50:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 2779 states have (on average 1.327455919395466) internal successors, (3689), 2819 states have internal predecessors, (3689), 293 states have call successors, (293), 198 states have call predecessors, (293), 245 states have return successors, (522), 302 states have call predecessors, (522), 293 states have call successors, (522) [2023-11-26 10:50:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4504 transitions. [2023-11-26 10:50:33,770 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4504 transitions. Word has length 87 [2023-11-26 10:50:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:33,770 INFO L495 AbstractCegarLoop]: Abstraction has 3318 states and 4504 transitions. [2023-11-26 10:50:33,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-26 10:50:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4504 transitions. [2023-11-26 10:50:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-26 10:50:33,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:33,773 INFO L195 NwaCegarLoop]: trace histogram [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-26 10:50:33,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:50:33,774 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:33,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2073794270, now seen corresponding path program 1 times [2023-11-26 10:50:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363000226] [2023-11-26 10:50:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-26 10:50:33,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:33,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363000226] [2023-11-26 10:50:33,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363000226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:33,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:33,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:33,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632732895] [2023-11-26 10:50:33,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:33,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:33,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:33,863 INFO L87 Difference]: Start difference. First operand 3318 states and 4504 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 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-26 10:50:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:34,408 INFO L93 Difference]: Finished difference Result 7151 states and 9670 transitions. [2023-11-26 10:50:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:50:34,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 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 87 [2023-11-26 10:50:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:34,433 INFO L225 Difference]: With dead ends: 7151 [2023-11-26 10:50:34,434 INFO L226 Difference]: Without dead ends: 3842 [2023-11-26 10:50:34,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-26 10:50:34,445 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 313 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:34,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 186 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:50:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2023-11-26 10:50:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3313. [2023-11-26 10:50:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 2777 states have (on average 1.3273316528628016) internal successors, (3686), 2816 states have internal predecessors, (3686), 290 states have call successors, (290), 198 states have call predecessors, (290), 245 states have return successors, (518), 299 states have call predecessors, (518), 290 states have call successors, (518) [2023-11-26 10:50:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4494 transitions. [2023-11-26 10:50:34,760 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4494 transitions. Word has length 87 [2023-11-26 10:50:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:34,761 INFO L495 AbstractCegarLoop]: Abstraction has 3313 states and 4494 transitions. [2023-11-26 10:50:34,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 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-26 10:50:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4494 transitions. [2023-11-26 10:50:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-26 10:50:34,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:34,764 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:34,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:50:34,764 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:34,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:34,765 INFO L85 PathProgramCache]: Analyzing trace with hash 696510049, now seen corresponding path program 1 times [2023-11-26 10:50:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:34,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573747823] [2023-11-26 10:50:34,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:34,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:34,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:34,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:50:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-26 10:50:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573747823] [2023-11-26 10:50:34,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573747823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:34,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427170277] [2023-11-26 10:50:34,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:34,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:34,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:34,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:34,891 INFO L87 Difference]: Start difference. First operand 3313 states and 4494 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-26 10:50:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:35,649 INFO L93 Difference]: Finished difference Result 8011 states and 10966 transitions. [2023-11-26 10:50:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:50:35,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2023-11-26 10:50:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:35,684 INFO L225 Difference]: With dead ends: 8011 [2023-11-26 10:50:35,684 INFO L226 Difference]: Without dead ends: 5328 [2023-11-26 10:50:35,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 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-26 10:50:35,696 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 404 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:35,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 247 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:50:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2023-11-26 10:50:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 4538. [2023-11-26 10:50:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4538 states, 3799 states have (on average 1.3227165043432483) internal successors, (5025), 3848 states have internal predecessors, (5025), 402 states have call successors, (402), 276 states have call predecessors, (402), 336 states have return successors, (684), 414 states have call predecessors, (684), 402 states have call successors, (684) [2023-11-26 10:50:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 6111 transitions. [2023-11-26 10:50:36,182 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 6111 transitions. Word has length 89 [2023-11-26 10:50:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:36,182 INFO L495 AbstractCegarLoop]: Abstraction has 4538 states and 6111 transitions. [2023-11-26 10:50:36,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-26 10:50:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 6111 transitions. [2023-11-26 10:50:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-26 10:50:36,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:36,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:50:36,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:50:36,188 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:36,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash -216901673, now seen corresponding path program 1 times [2023-11-26 10:50:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:36,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349429234] [2023-11-26 10:50:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:36,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-26 10:50:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 10:50:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-26 10:50:36,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:36,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349429234] [2023-11-26 10:50:36,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349429234] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:36,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330178815] [2023-11-26 10:50:36,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:36,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:36,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:36,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:36,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:50:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:36,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 10:50:36,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-26 10:50:36,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:50:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330178815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:50:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-26 10:50:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840511693] [2023-11-26 10:50:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:36,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:36,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:36,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:36,582 INFO L87 Difference]: Start difference. First operand 4538 states and 6111 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-26 10:50:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:37,033 INFO L93 Difference]: Finished difference Result 10339 states and 13915 transitions. [2023-11-26 10:50:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:37,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2023-11-26 10:50:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:37,077 INFO L225 Difference]: With dead ends: 10339 [2023-11-26 10:50:37,077 INFO L226 Difference]: Without dead ends: 5810 [2023-11-26 10:50:37,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:37,093 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:37,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 315 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2023-11-26 10:50:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 5789. [2023-11-26 10:50:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 4833 states have (on average 1.3167804676184565) internal successors, (6364), 4890 states have internal predecessors, (6364), 530 states have call successors, (530), 360 states have call predecessors, (530), 425 states have return successors, (825), 539 states have call predecessors, (825), 530 states have call successors, (825) [2023-11-26 10:50:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7719 transitions. [2023-11-26 10:50:37,572 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7719 transitions. Word has length 105 [2023-11-26 10:50:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:37,573 INFO L495 AbstractCegarLoop]: Abstraction has 5789 states and 7719 transitions. [2023-11-26 10:50:37,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-26 10:50:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7719 transitions. [2023-11-26 10:50:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-26 10:50:37,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:37,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:50:37,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:37,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-26 10:50:37,783 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:37,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1504373732, now seen corresponding path program 1 times [2023-11-26 10:50:37,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:37,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433994065] [2023-11-26 10:50:37,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-26 10:50:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-26 10:50:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:50:37,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:37,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433994065] [2023-11-26 10:50:37,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433994065] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:37,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19659068] [2023-11-26 10:50:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:37,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:37,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:37,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 10:50:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:38,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 10:50:38,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:50:38,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:50:38,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19659068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:38,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:50:38,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-26 10:50:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112154704] [2023-11-26 10:50:38,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:38,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:38,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:38,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:38,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:38,061 INFO L87 Difference]: Start difference. First operand 5789 states and 7719 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 10:50:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:38,512 INFO L93 Difference]: Finished difference Result 10396 states and 13874 transitions. [2023-11-26 10:50:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:38,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 108 [2023-11-26 10:50:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:38,534 INFO L225 Difference]: With dead ends: 10396 [2023-11-26 10:50:38,534 INFO L226 Difference]: Without dead ends: 5868 [2023-11-26 10:50:38,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:50:38,551 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 112 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:38,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 340 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5868 states. [2023-11-26 10:50:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5868 to 5778. [2023-11-26 10:50:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 4822 states have (on average 1.3079635006221484) internal successors, (6307), 4879 states have internal predecessors, (6307), 530 states have call successors, (530), 360 states have call predecessors, (530), 425 states have return successors, (730), 539 states have call predecessors, (730), 530 states have call successors, (730) [2023-11-26 10:50:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 7567 transitions. [2023-11-26 10:50:39,249 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 7567 transitions. Word has length 108 [2023-11-26 10:50:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:39,250 INFO L495 AbstractCegarLoop]: Abstraction has 5778 states and 7567 transitions. [2023-11-26 10:50:39,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 10:50:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 7567 transitions. [2023-11-26 10:50:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-26 10:50:39,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:39,258 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:39,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:39,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-26 10:50:39,470 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:39,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1790084883, now seen corresponding path program 1 times [2023-11-26 10:50:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834692720] [2023-11-26 10:50:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-26 10:50:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:50:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 10:50:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-26 10:50:39,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834692720] [2023-11-26 10:50:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834692720] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971728115] [2023-11-26 10:50:39,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:39,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:39,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:39,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 10:50:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:39,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:50:39,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-26 10:50:39,770 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:50:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971728115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:39,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:50:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-26 10:50:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674435860] [2023-11-26 10:50:39,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:39,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:39,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:39,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:39,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:39,776 INFO L87 Difference]: Start difference. First operand 5778 states and 7567 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 10:50:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:40,565 INFO L93 Difference]: Finished difference Result 16773 states and 22299 transitions. [2023-11-26 10:50:40,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:40,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 136 [2023-11-26 10:50:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:40,607 INFO L225 Difference]: With dead ends: 16773 [2023-11-26 10:50:40,607 INFO L226 Difference]: Without dead ends: 11005 [2023-11-26 10:50:40,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:40,628 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 139 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:40,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 314 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11005 states. [2023-11-26 10:50:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11005 to 10991. [2023-11-26 10:50:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10991 states, 9193 states have (on average 1.2933753943217665) internal successors, (11890), 9297 states have internal predecessors, (11890), 993 states have call successors, (993), 687 states have call predecessors, (993), 804 states have return successors, (1560), 1008 states have call predecessors, (1560), 993 states have call successors, (1560) [2023-11-26 10:50:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10991 states to 10991 states and 14443 transitions. [2023-11-26 10:50:41,529 INFO L78 Accepts]: Start accepts. Automaton has 10991 states and 14443 transitions. Word has length 136 [2023-11-26 10:50:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:41,530 INFO L495 AbstractCegarLoop]: Abstraction has 10991 states and 14443 transitions. [2023-11-26 10:50:41,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 10:50:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 10991 states and 14443 transitions. [2023-11-26 10:50:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-26 10:50:41,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:41,539 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:41,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:41,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:41,746 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:41,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1254459883, now seen corresponding path program 1 times [2023-11-26 10:50:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836358960] [2023-11-26 10:50:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-26 10:50:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-26 10:50:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-26 10:50:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-26 10:50:41,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836358960] [2023-11-26 10:50:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836358960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:41,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:41,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:50:41,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400575798] [2023-11-26 10:50:41,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:41,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:50:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:41,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:50:41,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:50:41,867 INFO L87 Difference]: Start difference. First operand 10991 states and 14443 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 10:50:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:43,159 INFO L93 Difference]: Finished difference Result 23035 states and 30162 transitions. [2023-11-26 10:50:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:50:43,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 137 [2023-11-26 10:50:43,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:43,205 INFO L225 Difference]: With dead ends: 23035 [2023-11-26 10:50:43,205 INFO L226 Difference]: Without dead ends: 12054 [2023-11-26 10:50:43,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 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-26 10:50:43,233 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 313 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:43,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 183 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:50:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2023-11-26 10:50:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 10559. [2023-11-26 10:50:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10559 states, 8869 states have (on average 1.2886458450783629) internal successors, (11429), 8979 states have internal predecessors, (11429), 918 states have call successors, (918), 645 states have call predecessors, (918), 771 states have return successors, (1471), 935 states have call predecessors, (1471), 918 states have call successors, (1471) [2023-11-26 10:50:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10559 states to 10559 states and 13818 transitions. [2023-11-26 10:50:44,435 INFO L78 Accepts]: Start accepts. Automaton has 10559 states and 13818 transitions. Word has length 137 [2023-11-26 10:50:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:44,436 INFO L495 AbstractCegarLoop]: Abstraction has 10559 states and 13818 transitions. [2023-11-26 10:50:44,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 10:50:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 10559 states and 13818 transitions. [2023-11-26 10:50:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-26 10:50:44,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:44,447 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:50:44,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:50:44,447 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:44,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1267645569, now seen corresponding path program 1 times [2023-11-26 10:50:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90179135] [2023-11-26 10:50:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:50:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-26 10:50:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-26 10:50:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:44,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90179135] [2023-11-26 10:50:44,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90179135] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:44,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509048226] [2023-11-26 10:50:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:44,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:44,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:44,577 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:44,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 10:50:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:44,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:50:44,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 10:50:44,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:50:44,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509048226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:44,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:50:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-26 10:50:44,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374551332] [2023-11-26 10:50:44,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:44,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:44,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:44,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:44,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:44,760 INFO L87 Difference]: Start difference. First operand 10559 states and 13818 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-26 10:50:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:45,623 INFO L93 Difference]: Finished difference Result 16629 states and 22261 transitions. [2023-11-26 10:50:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:45,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 138 [2023-11-26 10:50:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:45,658 INFO L225 Difference]: With dead ends: 16629 [2023-11-26 10:50:45,658 INFO L226 Difference]: Without dead ends: 10523 [2023-11-26 10:50:45,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 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-26 10:50:45,670 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 113 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:45,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 394 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2023-11-26 10:50:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10477. [2023-11-26 10:50:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10477 states, 8787 states have (on average 1.2700580402867874) internal successors, (11160), 8897 states have internal predecessors, (11160), 918 states have call successors, (918), 645 states have call predecessors, (918), 771 states have return successors, (1471), 935 states have call predecessors, (1471), 918 states have call successors, (1471) [2023-11-26 10:50:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10477 states to 10477 states and 13549 transitions. [2023-11-26 10:50:46,413 INFO L78 Accepts]: Start accepts. Automaton has 10477 states and 13549 transitions. Word has length 138 [2023-11-26 10:50:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:46,413 INFO L495 AbstractCegarLoop]: Abstraction has 10477 states and 13549 transitions. [2023-11-26 10:50:46,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-26 10:50:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 10477 states and 13549 transitions. [2023-11-26 10:50:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-26 10:50:46,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:46,423 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:50:46,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:46,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-26 10:50:46,629 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:46,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash -942763104, now seen corresponding path program 1 times [2023-11-26 10:50:46,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865055133] [2023-11-26 10:50:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:50:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-26 10:50:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-26 10:50:46,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:46,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865055133] [2023-11-26 10:50:46,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865055133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:46,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:50:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322256194] [2023-11-26 10:50:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:46,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:50:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:46,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:50:46,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:46,856 INFO L87 Difference]: Start difference. First operand 10477 states and 13549 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-26 10:50:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:48,027 INFO L93 Difference]: Finished difference Result 18286 states and 23578 transitions. [2023-11-26 10:50:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:50:48,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 139 [2023-11-26 10:50:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:48,058 INFO L225 Difference]: With dead ends: 18286 [2023-11-26 10:50:48,058 INFO L226 Difference]: Without dead ends: 8860 [2023-11-26 10:50:48,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:50:48,079 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 531 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:48,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 414 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:50:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8860 states. [2023-11-26 10:50:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8860 to 7787. [2023-11-26 10:50:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7787 states, 6590 states have (on average 1.2438543247344462) internal successors, (8197), 6671 states have internal predecessors, (8197), 634 states have call successors, (634), 462 states have call predecessors, (634), 562 states have return successors, (892), 654 states have call predecessors, (892), 634 states have call successors, (892) [2023-11-26 10:50:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 9723 transitions. [2023-11-26 10:50:48,781 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 9723 transitions. Word has length 139 [2023-11-26 10:50:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:48,782 INFO L495 AbstractCegarLoop]: Abstraction has 7787 states and 9723 transitions. [2023-11-26 10:50:48,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-26 10:50:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 9723 transitions. [2023-11-26 10:50:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-26 10:50:48,789 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:48,790 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:48,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 10:50:48,790 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:48,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -860840103, now seen corresponding path program 1 times [2023-11-26 10:50:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:48,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316922256] [2023-11-26 10:50:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:50:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-26 10:50:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 34 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-26 10:50:48,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:48,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316922256] [2023-11-26 10:50:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316922256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:50:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687970841] [2023-11-26 10:50:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:48,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:50:48,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:50:48,935 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:50:48,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-26 10:50:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:49,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:50:49,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:50:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-26 10:50:49,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:50:49,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687970841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:49,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:50:49,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-26 10:50:49,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687751271] [2023-11-26 10:50:49,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:49,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:50:49,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:50:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:50:49,152 INFO L87 Difference]: Start difference. First operand 7787 states and 9723 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-26 10:50:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:49,919 INFO L93 Difference]: Finished difference Result 13995 states and 17731 transitions. [2023-11-26 10:50:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:50:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 140 [2023-11-26 10:50:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:49,948 INFO L225 Difference]: With dead ends: 13995 [2023-11-26 10:50:49,949 INFO L226 Difference]: Without dead ends: 7805 [2023-11-26 10:50:49,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 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-26 10:50:49,967 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 86 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:49,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 333 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:50:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2023-11-26 10:50:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7787. [2023-11-26 10:50:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7787 states, 6590 states have (on average 1.2192716236722307) internal successors, (8035), 6671 states have internal predecessors, (8035), 634 states have call successors, (634), 462 states have call predecessors, (634), 562 states have return successors, (892), 654 states have call predecessors, (892), 634 states have call successors, (892) [2023-11-26 10:50:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 9561 transitions. [2023-11-26 10:50:50,903 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 9561 transitions. Word has length 140 [2023-11-26 10:50:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:50,904 INFO L495 AbstractCegarLoop]: Abstraction has 7787 states and 9561 transitions. [2023-11-26 10:50:50,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-26 10:50:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 9561 transitions. [2023-11-26 10:50:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-26 10:50:50,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:50,911 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:50,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-26 10:50:51,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-26 10:50:51,117 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:51,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash 941490296, now seen corresponding path program 2 times [2023-11-26 10:50:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493629588] [2023-11-26 10:50:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 10:50:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-26 10:50:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:50:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:50:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 10:50:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:50:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 10:50:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-26 10:50:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-26 10:50:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:50:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-26 10:50:51,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:50:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493629588] [2023-11-26 10:50:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493629588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:50:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:50:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:50:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176014236] [2023-11-26 10:50:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:50:51,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:50:51,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:50:51,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:50:51,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:50:51,317 INFO L87 Difference]: Start difference. First operand 7787 states and 9561 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-26 10:50:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:50:53,058 INFO L93 Difference]: Finished difference Result 18571 states and 23383 transitions. [2023-11-26 10:50:53,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-26 10:50:53,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 140 [2023-11-26 10:50:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:50:53,089 INFO L225 Difference]: With dead ends: 18571 [2023-11-26 10:50:53,090 INFO L226 Difference]: Without dead ends: 10794 [2023-11-26 10:50:53,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2023-11-26 10:50:53,106 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1060 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 10:50:53,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 293 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 10:50:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10794 states. [2023-11-26 10:50:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10794 to 9967. [2023-11-26 10:50:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9967 states, 8400 states have (on average 1.1648809523809525) internal successors, (9785), 8561 states have internal predecessors, (9785), 780 states have call successors, (780), 606 states have call predecessors, (780), 786 states have return successors, (1167), 800 states have call predecessors, (1167), 780 states have call successors, (1167) [2023-11-26 10:50:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9967 states to 9967 states and 11732 transitions. [2023-11-26 10:50:54,002 INFO L78 Accepts]: Start accepts. Automaton has 9967 states and 11732 transitions. Word has length 140 [2023-11-26 10:50:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:50:54,003 INFO L495 AbstractCegarLoop]: Abstraction has 9967 states and 11732 transitions. [2023-11-26 10:50:54,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-26 10:50:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 9967 states and 11732 transitions. [2023-11-26 10:50:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-26 10:50:54,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:50:54,013 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 10:50:54,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 10:50:54,013 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:50:54,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:50:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash 593334297, now seen corresponding path program 1 times [2023-11-26 10:50:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:50:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206625872] [2023-11-26 10:50:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:50:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:50:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:54,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:50:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:50:54,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:50:54,102 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:50:54,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 10:50:54,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-26 10:50:54,111 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] [2023-11-26 10:50:54,116 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:50:54,202 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-26 10:50:54,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-26 10:50:54,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:50:54 BoogieIcfgContainer [2023-11-26 10:50:54,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:50:54,277 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:50:54,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:50:54,278 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:50:54,278 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:50:17" (3/4) ... [2023-11-26 10:50:54,280 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 10:50:54,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-26 10:50:54,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-26 10:50:54,412 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:50:54,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:50:54,413 INFO L158 Benchmark]: Toolchain (without parser) took 38194.12ms. Allocated memory was 176.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 143.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-26 10:50:54,413 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:50:54,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.76ms. Allocated memory is still 176.2MB. Free memory was 143.3MB in the beginning and 132.6MB in the end (delta: 10.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-11-26 10:50:54,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.40ms. Allocated memory is still 176.2MB. Free memory was 132.6MB in the beginning and 130.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:50:54,415 INFO L158 Benchmark]: Boogie Preprocessor took 51.97ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 128.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:50:54,415 INFO L158 Benchmark]: RCFGBuilder took 667.30ms. Allocated memory is still 176.2MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 10:50:54,415 INFO L158 Benchmark]: TraceAbstraction took 36918.90ms. Allocated memory was 176.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 126.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-26 10:50:54,416 INFO L158 Benchmark]: Witness Printer took 135.07ms. Allocated memory is still 2.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:50:54,418 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.76ms. Allocated memory is still 176.2MB. Free memory was 143.3MB in the beginning and 132.6MB in the end (delta: 10.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.40ms. Allocated memory is still 176.2MB. Free memory was 132.6MB in the beginning and 130.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.97ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 128.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 667.30ms. Allocated memory is still 176.2MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36918.90ms. Allocated memory was 176.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 126.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 135.07ms. Allocated memory is still 2.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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 m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L334] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L339] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L344] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L349] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L354] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L367] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L372] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L377] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L382] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L387] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L528] COND TRUE 1 [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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, tmp=1, tmp_ndt_1=0] [L281-L292] { 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, M_E=2, T1_E=2, T2_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, tmp=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE, EXPR \read(tmp_ndt_2) [L300] EXPR t1_st = 1 [L301] CALL, EXPR transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L301] RET, EXPR transmit1() [L295-L306] { 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, M_E=2, T1_E=2, T2_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, tmp=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE, EXPR \read(tmp_ndt_3) [L314] EXPR t2_st = 1 [L315] CALL, EXPR transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L134] COND TRUE 1 [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L315] RET, EXPR transmit2() [L309-L320] { 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, M_E=2, T1_E=2, T2_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, tmp=1] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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, tmp=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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, tmp=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE, EXPR \read(tmp_ndt_1) [L286] EXPR m_st = 1 [L287] CALL, EXPR master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L58] COND TRUE 1 [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_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] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_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] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L66] COND TRUE 1 [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L287] RET, EXPR master() [L281-L292] { 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, M_E=2, T1_E=2, T2_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, tmp=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE, EXPR \read(tmp_ndt_2) [L300] EXPR t1_st = 1 [L301] CALL, EXPR transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L91] COND TRUE t1_pc == 1 [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_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] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_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] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L301] RET, EXPR transmit1() [L295-L306] { 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, M_E=2, T1_E=2, T2_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, tmp=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] [L126] COND TRUE t2_pc == 1 [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.7s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8547 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8347 mSDsluCounter, 8432 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5297 mSDsCounter, 1243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9850 IncrementalHoareTripleChecker+Invalid, 11093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1243 mSolverCounterUnsat, 3135 mSDtfsCounter, 9850 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1340 GetRequests, 1104 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10991occurred in iteration=19, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 8153 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2996 NumberOfCodeBlocks, 2996 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2825 ConstructedInterpolants, 0 QuantifiedInterpolants, 5717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2257 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 802/887 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-26 10:50:54,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfa36eac-9a70-4ef3-bae9-5ec09a7552ca/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE