./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB --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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:14:01,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:14:01,984 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:14:01,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:14:01,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:14:02,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:14:02,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:14:02,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:14:02,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:14:02,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:14:02,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:14:02,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:14:02,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:14:02,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:14:02,034 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:14:02,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:14:02,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:14:02,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:14:02,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:14:02,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:14:02,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:14:02,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:14:02,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:14:02,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:14:02,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:14:02,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:14:02,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:14:02,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:14:02,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:14:02,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:02,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:02,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:02,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:02,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:14:02,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:02,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:02,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:02,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:02,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:14:02,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:14:02,039 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:14:02,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:14:02,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:14:02,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:14:02,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:14:02,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:14:02,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:14:02,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:14:02,040 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2024-11-27 20:14:02,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:14:02,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:14:02,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:14:02,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:14:02,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:14:02,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-27 20:14:06,177 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/data/2b4948a70/bda15fe864fb4666ba6a28de1e1b44a0/FLAGda88b78a5 [2024-11-27 20:14:06,569 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:14:06,570 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-27 20:14:06,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/data/2b4948a70/bda15fe864fb4666ba6a28de1e1b44a0/FLAGda88b78a5 [2024-11-27 20:14:06,605 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/data/2b4948a70/bda15fe864fb4666ba6a28de1e1b44a0 [2024-11-27 20:14:06,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:14:06,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:14:06,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:06,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:14:06,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:14:06,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:06" (1/1) ... [2024-11-27 20:14:06,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ffab5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:06, skipping insertion in model container [2024-11-27 20:14:06,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:06" (1/1) ... [2024-11-27 20:14:06,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:14:06,885 WARN L250 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_44c3f571-93cd-4e83-a45b-e5f30eec3b35/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2024-11-27 20:14:07,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:07,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:14:07,033 WARN L250 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_44c3f571-93cd-4e83-a45b-e5f30eec3b35/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2024-11-27 20:14:07,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:07,123 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:14:07,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07 WrapperNode [2024-11-27 20:14:07,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:07,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:07,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:14:07,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:14:07,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,193 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 254 [2024-11-27 20:14:07,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:07,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:14:07,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:14:07,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:14:07,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,249 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]. [2024-11-27 20:14:07,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:14:07,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:14:07,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:14:07,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:14:07,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (1/1) ... [2024-11-27 20:14:07,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:07,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:07,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:14:07,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:14:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:14:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-27 20:14:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-27 20:14:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-27 20:14:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-27 20:14:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-27 20:14:07,392 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-27 20:14:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-27 20:14:07,392 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-27 20:14:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-27 20:14:07,392 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-27 20:14:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:14:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-27 20:14:07,393 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-27 20:14:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:14:07,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:14:07,518 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:14:07,521 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:14:08,059 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-27 20:14:08,059 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:14:08,074 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:14:08,074 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-27 20:14:08,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:08 BoogieIcfgContainer [2024-11-27 20:14:08,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:14:08,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:14:08,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:14:08,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:14:08,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:14:06" (1/3) ... [2024-11-27 20:14:08,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b25172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:08, skipping insertion in model container [2024-11-27 20:14:08,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:07" (2/3) ... [2024-11-27 20:14:08,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b25172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:08, skipping insertion in model container [2024-11-27 20:14:08,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:08" (3/3) ... [2024-11-27 20:14:08,088 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2024-11-27 20:14:08,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:14:08,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu1.cil.c that has 7 procedures, 106 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-27 20:14:08,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:14:08,226 INFO L333 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, 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;@5f7631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:14:08,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:14:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 87 states have internal predecessors, (125), 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) [2024-11-27 20:14:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-27 20:14:08,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:08,250 INFO L218 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] [2024-11-27 20:14:08,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:08,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2006516940, now seen corresponding path program 1 times [2024-11-27 20:14:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:08,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823350758] [2024-11-27 20:14:08,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:08,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:08,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823350758] [2024-11-27 20:14:08,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823350758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:08,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:08,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:14:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192665518] [2024-11-27 20:14:08,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:08,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:08,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:08,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:08,765 INFO L87 Difference]: Start difference. First operand has 106 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 87 states have internal predecessors, (125), 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 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:09,055 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2024-11-27 20:14:09,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:14:09,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-11-27 20:14:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:09,077 INFO L225 Difference]: With dead ends: 289 [2024-11-27 20:14:09,077 INFO L226 Difference]: Without dead ends: 185 [2024-11-27 20:14:09,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:09,095 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 237 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:09,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 460 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-27 20:14:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2024-11-27 20:14:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 142 states have (on average 1.4014084507042253) internal successors, (199), 145 states have internal predecessors, (199), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-27 20:14:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 242 transitions. [2024-11-27 20:14:09,199 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 242 transitions. Word has length 49 [2024-11-27 20:14:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:09,199 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 242 transitions. [2024-11-27 20:14:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 242 transitions. [2024-11-27 20:14:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-27 20:14:09,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:09,204 INFO L218 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] [2024-11-27 20:14:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:14:09,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:09,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash 659800083, now seen corresponding path program 1 times [2024-11-27 20:14:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566745315] [2024-11-27 20:14:09,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:09,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:09,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566745315] [2024-11-27 20:14:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566745315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:09,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:14:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906142996] [2024-11-27 20:14:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:09,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:14:09,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:09,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:14:09,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:09,377 INFO L87 Difference]: Start difference. First operand 176 states and 242 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:09,438 INFO L93 Difference]: Finished difference Result 345 states and 478 transitions. [2024-11-27 20:14:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:14:09,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-11-27 20:14:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:09,441 INFO L225 Difference]: With dead ends: 345 [2024-11-27 20:14:09,442 INFO L226 Difference]: Without dead ends: 179 [2024-11-27 20:14:09,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:09,444 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:09,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-27 20:14:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-27 20:14:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 148 states have internal predecessors, (201), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-27 20:14:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 244 transitions. [2024-11-27 20:14:09,471 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 244 transitions. Word has length 49 [2024-11-27 20:14:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:09,471 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 244 transitions. [2024-11-27 20:14:09,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 244 transitions. [2024-11-27 20:14:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-27 20:14:09,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:09,473 INFO L218 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] [2024-11-27 20:14:09,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:14:09,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:09,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash 682432337, now seen corresponding path program 1 times [2024-11-27 20:14:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918654274] [2024-11-27 20:14:09,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:09,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:09,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918654274] [2024-11-27 20:14:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918654274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:14:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273563535] [2024-11-27 20:14:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:14:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:09,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:14:09,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:09,678 INFO L87 Difference]: Start difference. First operand 179 states and 244 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:10,348 INFO L93 Difference]: Finished difference Result 726 states and 987 transitions. [2024-11-27 20:14:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:14:10,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-11-27 20:14:10,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:10,359 INFO L225 Difference]: With dead ends: 726 [2024-11-27 20:14:10,363 INFO L226 Difference]: Without dead ends: 529 [2024-11-27 20:14:10,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:14:10,370 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 542 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:10,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 540 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:14:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-27 20:14:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 397. [2024-11-27 20:14:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 328 states have (on average 1.3871951219512195) internal successors, (455), 330 states have internal predecessors, (455), 44 states have call successors, (44), 24 states have call predecessors, (44), 24 states have return successors, (43), 43 states have call predecessors, (43), 41 states have call successors, (43) [2024-11-27 20:14:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 542 transitions. [2024-11-27 20:14:10,466 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 542 transitions. Word has length 49 [2024-11-27 20:14:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:10,467 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 542 transitions. [2024-11-27 20:14:10,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 542 transitions. [2024-11-27 20:14:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-27 20:14:10,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:10,469 INFO L218 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] [2024-11-27 20:14:10,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:14:10,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash 599495755, now seen corresponding path program 1 times [2024-11-27 20:14:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226028589] [2024-11-27 20:14:10,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:10,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:10,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226028589] [2024-11-27 20:14:10,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226028589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:10,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:10,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:14:10,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13465153] [2024-11-27 20:14:10,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:10,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:10,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:10,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:10,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:10,631 INFO L87 Difference]: Start difference. First operand 397 states and 542 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:10,948 INFO L93 Difference]: Finished difference Result 1029 states and 1402 transitions. [2024-11-27 20:14:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:14:10,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-11-27 20:14:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:10,957 INFO L225 Difference]: With dead ends: 1029 [2024-11-27 20:14:10,958 INFO L226 Difference]: Without dead ends: 642 [2024-11-27 20:14:10,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:10,962 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 222 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:10,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 593 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-27 20:14:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 526. [2024-11-27 20:14:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 427 states have (on average 1.3138173302107727) internal successors, (561), 430 states have internal predecessors, (561), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2024-11-27 20:14:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 688 transitions. [2024-11-27 20:14:11,070 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 688 transitions. Word has length 50 [2024-11-27 20:14:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:11,071 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 688 transitions. [2024-11-27 20:14:11,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 688 transitions. [2024-11-27 20:14:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-27 20:14:11,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:11,074 INFO L218 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] [2024-11-27 20:14:11,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:14:11,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 291056746, now seen corresponding path program 1 times [2024-11-27 20:14:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872892901] [2024-11-27 20:14:11,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:11,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872892901] [2024-11-27 20:14:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872892901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:11,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:11,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:14:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124849449] [2024-11-27 20:14:11,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:11,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:14:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:11,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:14:11,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:11,185 INFO L87 Difference]: Start difference. First operand 526 states and 688 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:11,335 INFO L93 Difference]: Finished difference Result 1054 states and 1396 transitions. [2024-11-27 20:14:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:14:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-11-27 20:14:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:11,343 INFO L225 Difference]: With dead ends: 1054 [2024-11-27 20:14:11,345 INFO L226 Difference]: Without dead ends: 538 [2024-11-27 20:14:11,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:11,350 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:11,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 533 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-27 20:14:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-27 20:14:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 439 states have (on average 1.2984054669703873) internal successors, (570), 442 states have internal predecessors, (570), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2024-11-27 20:14:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 697 transitions. [2024-11-27 20:14:11,452 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 697 transitions. Word has length 50 [2024-11-27 20:14:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:11,453 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 697 transitions. [2024-11-27 20:14:11,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 697 transitions. [2024-11-27 20:14:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-27 20:14:11,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:11,459 INFO L218 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] [2024-11-27 20:14:11,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:14:11,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:11,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash 157043240, now seen corresponding path program 1 times [2024-11-27 20:14:11,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701902166] [2024-11-27 20:14:11,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:11,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:11,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701902166] [2024-11-27 20:14:11,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701902166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:11,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:11,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:14:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673358935] [2024-11-27 20:14:11,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:11,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:11,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:11,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:11,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:11,642 INFO L87 Difference]: Start difference. First operand 538 states and 697 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 20:14:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:11,829 INFO L93 Difference]: Finished difference Result 1306 states and 1690 transitions. [2024-11-27 20:14:11,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:14:11,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2024-11-27 20:14:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:11,841 INFO L225 Difference]: With dead ends: 1306 [2024-11-27 20:14:11,841 INFO L226 Difference]: Without dead ends: 844 [2024-11-27 20:14:11,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:11,846 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 100 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:11,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 390 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-27 20:14:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 839. [2024-11-27 20:14:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 688 states have (on average 1.2906976744186047) internal successors, (888), 691 states have internal predecessors, (888), 95 states have call successors, (95), 56 states have call predecessors, (95), 55 states have return successors, (98), 92 states have call predecessors, (98), 92 states have call successors, (98) [2024-11-27 20:14:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1081 transitions. [2024-11-27 20:14:12,035 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1081 transitions. Word has length 50 [2024-11-27 20:14:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:12,036 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1081 transitions. [2024-11-27 20:14:12,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 20:14:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1081 transitions. [2024-11-27 20:14:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-27 20:14:12,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:12,042 INFO L218 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] [2024-11-27 20:14:12,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:14:12,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1017880036, now seen corresponding path program 1 times [2024-11-27 20:14:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854144975] [2024-11-27 20:14:12,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:12,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854144975] [2024-11-27 20:14:12,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854144975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:12,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:12,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:14:12,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775267602] [2024-11-27 20:14:12,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:12,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:14:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:12,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:14:12,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:12,244 INFO L87 Difference]: Start difference. First operand 839 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 20:14:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:12,548 INFO L93 Difference]: Finished difference Result 1408 states and 1812 transitions. [2024-11-27 20:14:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:14:12,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2024-11-27 20:14:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:12,558 INFO L225 Difference]: With dead ends: 1408 [2024-11-27 20:14:12,559 INFO L226 Difference]: Without dead ends: 932 [2024-11-27 20:14:12,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:12,565 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 305 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:12,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 440 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-27 20:14:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 920. [2024-11-27 20:14:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 756 states have (on average 1.287037037037037) internal successors, (973), 759 states have internal predecessors, (973), 103 states have call successors, (103), 61 states have call predecessors, (103), 60 states have return successors, (106), 100 states have call predecessors, (106), 100 states have call successors, (106) [2024-11-27 20:14:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1182 transitions. [2024-11-27 20:14:12,721 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1182 transitions. Word has length 58 [2024-11-27 20:14:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:12,724 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1182 transitions. [2024-11-27 20:14:12,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 20:14:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1182 transitions. [2024-11-27 20:14:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-27 20:14:12,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:12,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:14:12,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:12,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1179756125, now seen corresponding path program 1 times [2024-11-27 20:14:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589953222] [2024-11-27 20:14:12,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:12,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:12,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589953222] [2024-11-27 20:14:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589953222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:12,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:14:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049406642] [2024-11-27 20:14:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:12,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:14:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:12,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:14:12,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:14:12,980 INFO L87 Difference]: Start difference. First operand 920 states and 1182 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 20:14:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:13,279 INFO L93 Difference]: Finished difference Result 2093 states and 2686 transitions. [2024-11-27 20:14:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:14:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2024-11-27 20:14:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:13,293 INFO L225 Difference]: With dead ends: 2093 [2024-11-27 20:14:13,293 INFO L226 Difference]: Without dead ends: 1249 [2024-11-27 20:14:13,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:14:13,299 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 211 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:13,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 565 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:14:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-27 20:14:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1227. [2024-11-27 20:14:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1011 states have (on average 1.2838773491592483) internal successors, (1298), 1014 states have internal predecessors, (1298), 135 states have call successors, (135), 81 states have call predecessors, (135), 80 states have return successors, (140), 132 states have call predecessors, (140), 132 states have call successors, (140) [2024-11-27 20:14:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1573 transitions. [2024-11-27 20:14:13,468 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1573 transitions. Word has length 61 [2024-11-27 20:14:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:13,468 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1573 transitions. [2024-11-27 20:14:13,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-27 20:14:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1573 transitions. [2024-11-27 20:14:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-27 20:14:13,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:13,472 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-27 20:14:13,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:14:13,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:13,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash -694294987, now seen corresponding path program 1 times [2024-11-27 20:14:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:13,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807545938] [2024-11-27 20:14:13,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:13,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:14:13,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:13,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807545938] [2024-11-27 20:14:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807545938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:13,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:13,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:14:13,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379218950] [2024-11-27 20:14:13,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:13,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:13,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:13,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:13,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:13,632 INFO L87 Difference]: Start difference. First operand 1227 states and 1573 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:14:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:14,100 INFO L93 Difference]: Finished difference Result 3663 states and 4772 transitions. [2024-11-27 20:14:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:14:14,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2024-11-27 20:14:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:14,124 INFO L225 Difference]: With dead ends: 3663 [2024-11-27 20:14:14,125 INFO L226 Difference]: Without dead ends: 2447 [2024-11-27 20:14:14,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:14,132 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 154 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:14,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 324 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2024-11-27 20:14:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2443. [2024-11-27 20:14:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2005 states have (on average 1.2528678304239402) internal successors, (2512), 2020 states have internal predecessors, (2512), 266 states have call successors, (266), 161 states have call predecessors, (266), 171 states have return successors, (355), 263 states have call predecessors, (355), 263 states have call successors, (355) [2024-11-27 20:14:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3133 transitions. [2024-11-27 20:14:14,391 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3133 transitions. Word has length 65 [2024-11-27 20:14:14,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:14,392 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3133 transitions. [2024-11-27 20:14:14,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:14:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3133 transitions. [2024-11-27 20:14:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-27 20:14:14,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:14,395 INFO L218 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] [2024-11-27 20:14:14,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:14:14,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:14,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1855232583, now seen corresponding path program 1 times [2024-11-27 20:14:14,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:14,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886447395] [2024-11-27 20:14:14,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 20:14:14,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886447395] [2024-11-27 20:14:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886447395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:14,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:14,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:14:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085369311] [2024-11-27 20:14:14,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:14,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:14:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:14,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:14:14,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:14,541 INFO L87 Difference]: Start difference. First operand 2443 states and 3133 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:14:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:15,265 INFO L93 Difference]: Finished difference Result 6311 states and 8198 transitions. [2024-11-27 20:14:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:14:15,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 67 [2024-11-27 20:14:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:15,297 INFO L225 Difference]: With dead ends: 6311 [2024-11-27 20:14:15,298 INFO L226 Difference]: Without dead ends: 3884 [2024-11-27 20:14:15,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:14:15,308 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 605 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:15,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 601 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:14:15,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2024-11-27 20:14:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3799. [2024-11-27 20:14:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3799 states, 3087 states have (on average 1.225137674117266) internal successors, (3782), 3112 states have internal predecessors, (3782), 432 states have call successors, (432), 261 states have call predecessors, (432), 279 states have return successors, (631), 429 states have call predecessors, (631), 429 states have call successors, (631) [2024-11-27 20:14:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3799 states to 3799 states and 4845 transitions. [2024-11-27 20:14:15,660 INFO L78 Accepts]: Start accepts. Automaton has 3799 states and 4845 transitions. Word has length 67 [2024-11-27 20:14:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:15,661 INFO L471 AbstractCegarLoop]: Abstraction has 3799 states and 4845 transitions. [2024-11-27 20:14:15,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:14:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3799 states and 4845 transitions. [2024-11-27 20:14:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 20:14:15,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:15,664 INFO L218 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] [2024-11-27 20:14:15,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:14:15,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:15,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash -263299858, now seen corresponding path program 1 times [2024-11-27 20:14:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:15,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604928530] [2024-11-27 20:14:15,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:15,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 20:14:15,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:15,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604928530] [2024-11-27 20:14:15,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604928530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:15,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:15,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:14:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87515147] [2024-11-27 20:14:15,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:15,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:15,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:15,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:15,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:15,751 INFO L87 Difference]: Start difference. First operand 3799 states and 4845 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:14:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:16,268 INFO L93 Difference]: Finished difference Result 7224 states and 9167 transitions. [2024-11-27 20:14:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:14:16,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2024-11-27 20:14:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:16,296 INFO L225 Difference]: With dead ends: 7224 [2024-11-27 20:14:16,296 INFO L226 Difference]: Without dead ends: 3852 [2024-11-27 20:14:16,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:16,308 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 115 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:16,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 309 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2024-11-27 20:14:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3712. [2024-11-27 20:14:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3002 states have (on average 1.2135243171219188) internal successors, (3643), 3051 states have internal predecessors, (3643), 416 states have call successors, (416), 251 states have call predecessors, (416), 293 states have return successors, (574), 413 states have call predecessors, (574), 413 states have call successors, (574) [2024-11-27 20:14:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 4633 transitions. [2024-11-27 20:14:16,606 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 4633 transitions. Word has length 68 [2024-11-27 20:14:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:16,606 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 4633 transitions. [2024-11-27 20:14:16,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:14:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 4633 transitions. [2024-11-27 20:14:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 20:14:16,615 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:16,615 INFO L218 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] [2024-11-27 20:14:16,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:14:16,615 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:16,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:16,616 INFO L85 PathProgramCache]: Analyzing trace with hash -61475924, now seen corresponding path program 1 times [2024-11-27 20:14:16,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:16,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370115745] [2024-11-27 20:14:16,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-27 20:14:16,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370115745] [2024-11-27 20:14:16,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370115745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:16,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:16,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:14:16,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512405506] [2024-11-27 20:14:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:16,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:16,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:16,671 INFO L87 Difference]: Start difference. First operand 3712 states and 4633 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:16,945 INFO L93 Difference]: Finished difference Result 3967 states and 4940 transitions. [2024-11-27 20:14:16,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:16,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-27 20:14:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:16,973 INFO L225 Difference]: With dead ends: 3967 [2024-11-27 20:14:16,974 INFO L226 Difference]: Without dead ends: 3704 [2024-11-27 20:14:16,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:16,978 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:16,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2024-11-27 20:14:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3584. [2024-11-27 20:14:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 2906 states have (on average 1.2143840330351) internal successors, (3529), 2953 states have internal predecessors, (3529), 394 states have call successors, (394), 241 states have call predecessors, (394), 283 states have return successors, (549), 391 states have call predecessors, (549), 391 states have call successors, (549) [2024-11-27 20:14:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4472 transitions. [2024-11-27 20:14:17,369 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4472 transitions. Word has length 68 [2024-11-27 20:14:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:17,370 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 4472 transitions. [2024-11-27 20:14:17,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-27 20:14:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4472 transitions. [2024-11-27 20:14:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-27 20:14:17,372 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:17,372 INFO L218 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] [2024-11-27 20:14:17,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:14:17,373 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:17,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash 865245207, now seen corresponding path program 1 times [2024-11-27 20:14:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146258860] [2024-11-27 20:14:17,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:17,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:14:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146258860] [2024-11-27 20:14:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146258860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:17,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:17,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:14:17,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033417853] [2024-11-27 20:14:17,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:17,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:14:17,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:17,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:14:17,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:14:17,506 INFO L87 Difference]: Start difference. First operand 3584 states and 4472 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:14:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:18,480 INFO L93 Difference]: Finished difference Result 7238 states and 9009 transitions. [2024-11-27 20:14:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:14:18,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2024-11-27 20:14:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:18,507 INFO L225 Difference]: With dead ends: 7238 [2024-11-27 20:14:18,507 INFO L226 Difference]: Without dead ends: 3611 [2024-11-27 20:14:18,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:14:18,521 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 756 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:18,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 878 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:14:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2024-11-27 20:14:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3525. [2024-11-27 20:14:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 2860 states have (on average 1.1986013986013986) internal successors, (3428), 2907 states have internal predecessors, (3428), 386 states have call successors, (386), 236 states have call predecessors, (386), 278 states have return successors, (469), 383 states have call predecessors, (469), 383 states have call successors, (469) [2024-11-27 20:14:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 4283 transitions. [2024-11-27 20:14:18,945 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 4283 transitions. Word has length 69 [2024-11-27 20:14:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:18,945 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 4283 transitions. [2024-11-27 20:14:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 20:14:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 4283 transitions. [2024-11-27 20:14:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-27 20:14:18,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:18,958 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:18,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:14:18,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:18,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2053851138, now seen corresponding path program 1 times [2024-11-27 20:14:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348937540] [2024-11-27 20:14:18,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:18,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-27 20:14:19,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:19,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348937540] [2024-11-27 20:14:19,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348937540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676350619] [2024-11-27 20:14:19,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:19,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:19,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:14:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:19,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:14:19,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-27 20:14:19,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676350619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:19,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:14:19,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-27 20:14:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904124840] [2024-11-27 20:14:19,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:19,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:19,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:19,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:14:19,589 INFO L87 Difference]: Start difference. First operand 3525 states and 4283 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-27 20:14:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:19,780 INFO L93 Difference]: Finished difference Result 5552 states and 6777 transitions. [2024-11-27 20:14:19,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:19,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-27 20:14:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:19,799 INFO L225 Difference]: With dead ends: 5552 [2024-11-27 20:14:19,799 INFO L226 Difference]: Without dead ends: 2315 [2024-11-27 20:14:19,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:14:19,810 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:19,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 131 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2024-11-27 20:14:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2179. [2024-11-27 20:14:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1770 states have (on average 1.1847457627118645) internal successors, (2097), 1797 states have internal predecessors, (2097), 238 states have call successors, (238), 146 states have call predecessors, (238), 170 states have return successors, (286), 236 states have call predecessors, (286), 236 states have call successors, (286) [2024-11-27 20:14:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2621 transitions. [2024-11-27 20:14:20,033 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2621 transitions. Word has length 122 [2024-11-27 20:14:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:20,033 INFO L471 AbstractCegarLoop]: Abstraction has 2179 states and 2621 transitions. [2024-11-27 20:14:20,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-27 20:14:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2621 transitions. [2024-11-27 20:14:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-27 20:14:20,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:20,039 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 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] [2024-11-27 20:14:20,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:14:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-27 20:14:20,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:20,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1535570581, now seen corresponding path program 1 times [2024-11-27 20:14:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523739291] [2024-11-27 20:14:20,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-27 20:14:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523739291] [2024-11-27 20:14:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523739291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:20,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811162197] [2024-11-27 20:14:20,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:20,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:20,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:14:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:20,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:14:20,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-27 20:14:20,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:20,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811162197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:20,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:14:20,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-27 20:14:20,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270409153] [2024-11-27 20:14:20,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:20,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:20,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:20,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:14:20,828 INFO L87 Difference]: Start difference. First operand 2179 states and 2621 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-27 20:14:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:21,038 INFO L93 Difference]: Finished difference Result 4669 states and 5600 transitions. [2024-11-27 20:14:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:21,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-27 20:14:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:21,058 INFO L225 Difference]: With dead ends: 4669 [2024-11-27 20:14:21,058 INFO L226 Difference]: Without dead ends: 2685 [2024-11-27 20:14:21,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:14:21,066 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 44 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:21,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 251 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-11-27 20:14:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2024-11-27 20:14:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2685 states, 2167 states have (on average 1.1707429626211352) internal successors, (2537), 2195 states have internal predecessors, (2537), 301 states have call successors, (301), 191 states have call predecessors, (301), 216 states have return successors, (350), 299 states have call predecessors, (350), 299 states have call successors, (350) [2024-11-27 20:14:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3188 transitions. [2024-11-27 20:14:21,329 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3188 transitions. Word has length 126 [2024-11-27 20:14:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:21,330 INFO L471 AbstractCegarLoop]: Abstraction has 2685 states and 3188 transitions. [2024-11-27 20:14:21,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-27 20:14:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3188 transitions. [2024-11-27 20:14:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-27 20:14:21,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:21,338 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:21,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:14:21,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-27 20:14:21,539 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:21,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash 798638076, now seen corresponding path program 1 times [2024-11-27 20:14:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:21,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601946140] [2024-11-27 20:14:21,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-27 20:14:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:21,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601946140] [2024-11-27 20:14:21,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601946140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:21,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723308675] [2024-11-27 20:14:21,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:21,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:21,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:21,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:21,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:14:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:21,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:14:21,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-27 20:14:22,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:22,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723308675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:22,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:14:22,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-27 20:14:22,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878245174] [2024-11-27 20:14:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:22,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:14:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:22,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:14:22,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:14:22,043 INFO L87 Difference]: Start difference. First operand 2685 states and 3188 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-27 20:14:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:22,236 INFO L93 Difference]: Finished difference Result 4595 states and 5465 transitions. [2024-11-27 20:14:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:14:22,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 149 [2024-11-27 20:14:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:22,252 INFO L225 Difference]: With dead ends: 4595 [2024-11-27 20:14:22,252 INFO L226 Difference]: Without dead ends: 1921 [2024-11-27 20:14:22,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:14:22,261 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:22,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2024-11-27 20:14:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2024-11-27 20:14:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1613 states have (on average 1.171109733415995) internal successors, (1889), 1622 states have internal predecessors, (1889), 173 states have call successors, (173), 111 states have call predecessors, (173), 134 states have return successors, (210), 187 states have call predecessors, (210), 171 states have call successors, (210) [2024-11-27 20:14:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2272 transitions. [2024-11-27 20:14:22,413 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2272 transitions. Word has length 149 [2024-11-27 20:14:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:22,414 INFO L471 AbstractCegarLoop]: Abstraction has 1921 states and 2272 transitions. [2024-11-27 20:14:22,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-27 20:14:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2272 transitions. [2024-11-27 20:14:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-27 20:14:22,418 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:22,418 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:22,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:14:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-27 20:14:22,619 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash -553316207, now seen corresponding path program 1 times [2024-11-27 20:14:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558975178] [2024-11-27 20:14:22,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-27 20:14:22,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558975178] [2024-11-27 20:14:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558975178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:22,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:14:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679465517] [2024-11-27 20:14:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:22,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:22,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:22,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:22,823 INFO L87 Difference]: Start difference. First operand 1921 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-27 20:14:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:22,949 INFO L93 Difference]: Finished difference Result 1924 states and 2274 transitions. [2024-11-27 20:14:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2024-11-27 20:14:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:22,966 INFO L225 Difference]: With dead ends: 1924 [2024-11-27 20:14:22,968 INFO L226 Difference]: Without dead ends: 1723 [2024-11-27 20:14:22,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:22,970 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 38 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:22,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 235 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:22,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2024-11-27 20:14:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2024-11-27 20:14:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1451 states have (on average 1.1743625086147484) internal successors, (1704), 1460 states have internal predecessors, (1704), 152 states have call successors, (152), 97 states have call predecessors, (152), 119 states have return successors, (187), 165 states have call predecessors, (187), 150 states have call successors, (187) [2024-11-27 20:14:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2043 transitions. [2024-11-27 20:14:23,101 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2043 transitions. Word has length 153 [2024-11-27 20:14:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:23,101 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2043 transitions. [2024-11-27 20:14:23,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-27 20:14:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2043 transitions. [2024-11-27 20:14:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-27 20:14:23,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:23,106 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:23,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:14:23,106 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:23,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:23,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1599657509, now seen corresponding path program 1 times [2024-11-27 20:14:23,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:23,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856213632] [2024-11-27 20:14:23,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-27 20:14:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856213632] [2024-11-27 20:14:23,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856213632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123692458] [2024-11-27 20:14:23,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:23,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:23,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:23,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:23,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:14:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:23,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:14:23,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-27 20:14:23,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123692458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:23,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:14:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2024-11-27 20:14:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487895747] [2024-11-27 20:14:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:23,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:23,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:23,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:23,639 INFO L87 Difference]: Start difference. First operand 1723 states and 2043 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-27 20:14:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:23,822 INFO L93 Difference]: Finished difference Result 3213 states and 3832 transitions. [2024-11-27 20:14:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:23,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 159 [2024-11-27 20:14:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:23,837 INFO L225 Difference]: With dead ends: 3213 [2024-11-27 20:14:23,837 INFO L226 Difference]: Without dead ends: 1634 [2024-11-27 20:14:23,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:23,843 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 25 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:23,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 245 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-27 20:14:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-11-27 20:14:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1381 states have (on average 1.1759594496741492) internal successors, (1624), 1390 states have internal predecessors, (1624), 141 states have call successors, (141), 90 states have call predecessors, (141), 111 states have return successors, (175), 153 states have call predecessors, (175), 139 states have call successors, (175) [2024-11-27 20:14:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1940 transitions. [2024-11-27 20:14:24,033 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1940 transitions. Word has length 159 [2024-11-27 20:14:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:24,034 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 1940 transitions. [2024-11-27 20:14:24,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-27 20:14:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1940 transitions. [2024-11-27 20:14:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-27 20:14:24,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:24,038 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:24,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 20:14:24,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-27 20:14:24,239 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:24,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1058953409, now seen corresponding path program 1 times [2024-11-27 20:14:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:24,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87437412] [2024-11-27 20:14:24,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:24,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-27 20:14:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87437412] [2024-11-27 20:14:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87437412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441525282] [2024-11-27 20:14:24,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:24,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:24,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:24,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:14:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:24,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 20:14:24,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 66 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-27 20:14:25,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-27 20:14:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441525282] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:14:25,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:14:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 11 [2024-11-27 20:14:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600052177] [2024-11-27 20:14:25,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:14:25,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:14:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:25,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:14:25,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:14:25,782 INFO L87 Difference]: Start difference. First operand 1634 states and 1940 transitions. Second operand has 11 states, 11 states have (on average 19.363636363636363) internal successors, (213), 11 states have internal predecessors, (213), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-27 20:14:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:26,330 INFO L93 Difference]: Finished difference Result 4530 states and 5428 transitions. [2024-11-27 20:14:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:14:26,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 19.363636363636363) internal successors, (213), 11 states have internal predecessors, (213), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 160 [2024-11-27 20:14:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:26,362 INFO L225 Difference]: With dead ends: 4530 [2024-11-27 20:14:26,363 INFO L226 Difference]: Without dead ends: 3092 [2024-11-27 20:14:26,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 314 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:14:26,368 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 363 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:26,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1201 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:14:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2024-11-27 20:14:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2938. [2024-11-27 20:14:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2495 states have (on average 1.1799599198396793) internal successors, (2944), 2512 states have internal predecessors, (2944), 246 states have call successors, (246), 154 states have call predecessors, (246), 196 states have return successors, (314), 271 states have call predecessors, (314), 244 states have call successors, (314) [2024-11-27 20:14:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 3504 transitions. [2024-11-27 20:14:26,613 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 3504 transitions. Word has length 160 [2024-11-27 20:14:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:26,614 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 3504 transitions. [2024-11-27 20:14:26,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.363636363636363) internal successors, (213), 11 states have internal predecessors, (213), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-27 20:14:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 3504 transitions. [2024-11-27 20:14:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-27 20:14:26,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:26,622 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:26,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:14:26,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:26,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash -911148119, now seen corresponding path program 1 times [2024-11-27 20:14:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:26,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806192803] [2024-11-27 20:14:26,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 70 proven. 14 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-27 20:14:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806192803] [2024-11-27 20:14:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806192803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885490534] [2024-11-27 20:14:26,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:26,998 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:27,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:14:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:27,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:14:27,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-27 20:14:27,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:27,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885490534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:27,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:14:27,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-27 20:14:27,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442720355] [2024-11-27 20:14:27,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:27,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:27,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:27,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:27,344 INFO L87 Difference]: Start difference. First operand 2938 states and 3504 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-27 20:14:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:27,626 INFO L93 Difference]: Finished difference Result 7241 states and 8682 transitions. [2024-11-27 20:14:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:27,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 240 [2024-11-27 20:14:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:27,647 INFO L225 Difference]: With dead ends: 7241 [2024-11-27 20:14:27,647 INFO L226 Difference]: Without dead ends: 4499 [2024-11-27 20:14:27,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:27,655 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 60 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:27,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 332 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2024-11-27 20:14:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 4440. [2024-11-27 20:14:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 3764 states have (on average 1.1764080765143465) internal successors, (4428), 3781 states have internal predecessors, (4428), 386 states have call successors, (386), 239 states have call predecessors, (386), 289 states have return successors, (462), 419 states have call predecessors, (462), 384 states have call successors, (462) [2024-11-27 20:14:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 5276 transitions. [2024-11-27 20:14:27,903 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 5276 transitions. Word has length 240 [2024-11-27 20:14:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:27,904 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 5276 transitions. [2024-11-27 20:14:27,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-27 20:14:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 5276 transitions. [2024-11-27 20:14:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-27 20:14:27,912 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:27,913 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:27,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 20:14:28,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:28,114 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:28,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1252468455, now seen corresponding path program 1 times [2024-11-27 20:14:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124154475] [2024-11-27 20:14:28,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 70 proven. 14 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-27 20:14:28,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124154475] [2024-11-27 20:14:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124154475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195901886] [2024-11-27 20:14:28,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:28,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:28,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:28,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:28,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:14:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:28,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:14:28,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-27 20:14:28,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:28,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195901886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:28,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:14:28,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-27 20:14:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763524972] [2024-11-27 20:14:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:28,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:28,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:28,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:28,626 INFO L87 Difference]: Start difference. First operand 4440 states and 5276 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-27 20:14:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:28,873 INFO L93 Difference]: Finished difference Result 5081 states and 6045 transitions. [2024-11-27 20:14:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:28,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 240 [2024-11-27 20:14:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:28,895 INFO L225 Difference]: With dead ends: 5081 [2024-11-27 20:14:28,895 INFO L226 Difference]: Without dead ends: 4443 [2024-11-27 20:14:28,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:28,901 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 49 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:28,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 326 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2024-11-27 20:14:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4440. [2024-11-27 20:14:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 3764 states have (on average 1.173219978746015) internal successors, (4416), 3781 states have internal predecessors, (4416), 386 states have call successors, (386), 239 states have call predecessors, (386), 289 states have return successors, (462), 419 states have call predecessors, (462), 384 states have call successors, (462) [2024-11-27 20:14:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 5264 transitions. [2024-11-27 20:14:29,194 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 5264 transitions. Word has length 240 [2024-11-27 20:14:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:29,195 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 5264 transitions. [2024-11-27 20:14:29,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-27 20:14:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 5264 transitions. [2024-11-27 20:14:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-27 20:14:29,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:29,204 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-27 20:14:29,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 20:14:29,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:29,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:29,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash -891229447, now seen corresponding path program 1 times [2024-11-27 20:14:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:29,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834090446] [2024-11-27 20:14:29,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2024-11-27 20:14:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:29,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834090446] [2024-11-27 20:14:29,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834090446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:29,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:29,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:14:29,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940117897] [2024-11-27 20:14:29,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:29,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:29,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:29,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:29,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:29,514 INFO L87 Difference]: Start difference. First operand 4440 states and 5264 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-27 20:14:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:29,678 INFO L93 Difference]: Finished difference Result 6737 states and 8000 transitions. [2024-11-27 20:14:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:29,679 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 243 [2024-11-27 20:14:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:29,696 INFO L225 Difference]: With dead ends: 6737 [2024-11-27 20:14:29,696 INFO L226 Difference]: Without dead ends: 2438 [2024-11-27 20:14:29,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:29,709 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 22 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:29,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 265 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2024-11-27 20:14:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2438. [2024-11-27 20:14:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 2091 states have (on average 1.146341463414634) internal successors, (2397), 2108 states have internal predecessors, (2397), 182 states have call successors, (182), 122 states have call predecessors, (182), 164 states have return successors, (223), 207 states have call predecessors, (223), 180 states have call successors, (223) [2024-11-27 20:14:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 2802 transitions. [2024-11-27 20:14:29,934 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 2802 transitions. Word has length 243 [2024-11-27 20:14:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:29,937 INFO L471 AbstractCegarLoop]: Abstraction has 2438 states and 2802 transitions. [2024-11-27 20:14:29,938 INFO L472 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-27 20:14:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 2802 transitions. [2024-11-27 20:14:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-27 20:14:29,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:29,945 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-27 20:14:29,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 20:14:29,945 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:29,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1671446310, now seen corresponding path program 1 times [2024-11-27 20:14:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810900641] [2024-11-27 20:14:29,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:14:30,007 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:14:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:14:30,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:14:30,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:14:30,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:14:30,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 20:14:30,190 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:30,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:14:30,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:14:30 BoogieIcfgContainer [2024-11-27 20:14:30,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:14:30,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:14:30,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:14:30,410 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:14:30,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:08" (3/4) ... [2024-11-27 20:14:30,412 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 20:14:30,718 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 179. [2024-11-27 20:14:30,894 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 20:14:30,895 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 20:14:30,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:14:30,896 INFO L158 Benchmark]: Toolchain (without parser) took 24285.45ms. Allocated memory was 142.6MB in the beginning and 796.9MB in the end (delta: 654.3MB). Free memory was 119.4MB in the beginning and 641.3MB in the end (delta: -522.0MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. [2024-11-27 20:14:30,897 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:14:30,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.05ms. Allocated memory is still 142.6MB. Free memory was 119.2MB in the beginning and 105.8MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:14:30,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.04ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:14:30,898 INFO L158 Benchmark]: Boogie Preprocessor took 84.37ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 101.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:14:30,898 INFO L158 Benchmark]: RCFGBuilder took 792.35ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 82.8MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:14:30,898 INFO L158 Benchmark]: TraceAbstraction took 22330.30ms. Allocated memory was 142.6MB in the beginning and 796.9MB in the end (delta: 654.3MB). Free memory was 82.1MB in the beginning and 670.7MB in the end (delta: -588.6MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2024-11-27 20:14:30,899 INFO L158 Benchmark]: Witness Printer took 486.16ms. Allocated memory is still 796.9MB. Free memory was 670.7MB in the beginning and 641.3MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-27 20:14:30,901 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.56ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.05ms. Allocated memory is still 142.6MB. Free memory was 119.2MB in the beginning and 105.8MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.04ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 103.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.37ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 101.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 792.35ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 82.8MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22330.30ms. Allocated memory was 142.6MB in the beginning and 796.9MB in the end (delta: 654.3MB). Free memory was 82.1MB in the beginning and 670.7MB in the end (delta: -588.6MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. * Witness Printer took 486.16ms. Allocated memory is still 796.9MB. Free memory was 670.7MB in the beginning and 641.3MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \result=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \result=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \result=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \result=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L427] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L427] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 23, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4067 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4053 mSDsluCounter, 9920 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5994 mSDsCounter, 491 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1219 IncrementalHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 491 mSolverCounterUnsat, 3926 mSDtfsCounter, 1219 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1492 GetRequests, 1398 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4440occurred in iteration=20, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 1083 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 3808 NumberOfCodeBlocks, 3808 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3671 ConstructedInterpolants, 0 QuantifiedInterpolants, 6197 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3289 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 30 InterpolantComputations, 21 PerfectInterpolantSequences, 3373/3484 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 20:14:30,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44c3f571-93cd-4e83-a45b-e5f30eec3b35/bin/uautomizer-verify-aQ6SnzHsRB/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