./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.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_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1 --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 9078dc62fb834f9a41b95ee6a842bb2e61905311e37b0fb13d9ab1be77d00451 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:58:35,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:58:35,822 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 14:58:35,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:58:35,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:58:35,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:58:35,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:58:35,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:58:35,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:58:35,850 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:58:35,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:58:35,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:58:35,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:58:35,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:58:35,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 14:58:35,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:58:35,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:58:35,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:58:35,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:58:35,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:58:35,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:58:35,853 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_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1 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 -> 9078dc62fb834f9a41b95ee6a842bb2e61905311e37b0fb13d9ab1be77d00451 [2024-12-02 14:58:36,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:58:36,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:58:36,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:58:36,103 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:58:36,104 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:58:36,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-12-02 14:58:38,741 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/data/2feb378bc/8afabf9fc4af4c8e88e7625bb61a5686/FLAG77faa0f5c [2024-12-02 14:58:39,129 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:58:39,130 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-12-02 14:58:39,156 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/data/2feb378bc/8afabf9fc4af4c8e88e7625bb61a5686/FLAG77faa0f5c [2024-12-02 14:58:39,302 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/data/2feb378bc/8afabf9fc4af4c8e88e7625bb61a5686 [2024-12-02 14:58:39,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:58:39,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:58:39,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:58:39,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:58:39,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:58:39,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:39" (1/1) ... [2024-12-02 14:58:39,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8b6e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:39, skipping insertion in model container [2024-12-02 14:58:39,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:39" (1/1) ... [2024-12-02 14:58:39,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:58:39,674 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_e34a088e-48ba-4a21-8758-bdcb494472f6/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c[6487,6500] [2024-12-02 14:58:39,724 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_e34a088e-48ba-4a21-8758-bdcb494472f6/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c[13423,13436] [2024-12-02 14:58:40,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:58:40,331 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:58:40,356 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_e34a088e-48ba-4a21-8758-bdcb494472f6/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c[6487,6500] [2024-12-02 14:58:40,368 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_e34a088e-48ba-4a21-8758-bdcb494472f6/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c[13423,13436] [2024-12-02 14:58:40,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:58:40,803 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:58:40,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40 WrapperNode [2024-12-02 14:58:40,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:58:40,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:58:40,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:58:40,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:58:40,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:40,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,060 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4982 [2024-12-02 14:58:41,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:58:41,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:58:41,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:58:41,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:58:41,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,206 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-12-02 14:58:41,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:58:41,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:58:41,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:58:41,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:58:41,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (1/1) ... [2024-12-02 14:58:41,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:58:41,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:41,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:58:41,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:58:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:58:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:58:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:58:41,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:58:41,583 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:58:41,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:58:45,966 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-12-02 14:58:45,966 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:58:45,992 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:58:45,992 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-12-02 14:58:45,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:45 BoogieIcfgContainer [2024-12-02 14:58:45,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:58:45,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:58:45,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:58:46,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:58:46,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:58:39" (1/3) ... [2024-12-02 14:58:46,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10189904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:58:46, skipping insertion in model container [2024-12-02 14:58:46,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:40" (2/3) ... [2024-12-02 14:58:46,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10189904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:58:46, skipping insertion in model container [2024-12-02 14:58:46,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:45" (3/3) ... [2024-12-02 14:58:46,002 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-12-02 14:58:46,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:58:46,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 874 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-12-02 14:58:46,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:58:46,105 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;@6d86b3be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:58:46,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-02 14:58:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 874 states, 871 states have (on average 1.9058553386911596) internal successors, (1660), 873 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 14:58:46,119 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:46,120 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] [2024-12-02 14:58:46,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:46,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash -934405548, now seen corresponding path program 1 times [2024-12-02 14:58:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:46,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78334361] [2024-12-02 14:58:46,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:46,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78334361] [2024-12-02 14:58:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78334361] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:46,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:46,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:58:46,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939437668] [2024-12-02 14:58:46,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:46,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 14:58:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:46,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 14:58:46,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 14:58:46,318 INFO L87 Difference]: Start difference. First operand has 874 states, 871 states have (on average 1.9058553386911596) internal successors, (1660), 873 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:46,388 INFO L93 Difference]: Finished difference Result 1724 states and 3278 transitions. [2024-12-02 14:58:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 14:58:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-12-02 14:58:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:46,403 INFO L225 Difference]: With dead ends: 1724 [2024-12-02 14:58:46,403 INFO L226 Difference]: Without dead ends: 808 [2024-12-02 14:58:46,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 14:58:46,411 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:46,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-12-02 14:58:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-12-02 14:58:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8945409429280398) internal successors, (1527), 807 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2024-12-02 14:58:46,474 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2024-12-02 14:58:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:46,474 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2024-12-02 14:58:46,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2024-12-02 14:58:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 14:58:46,475 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:46,475 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] [2024-12-02 14:58:46,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:58:46,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:46,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:46,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1945522798, now seen corresponding path program 1 times [2024-12-02 14:58:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:46,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295656286] [2024-12-02 14:58:46,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:46,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:46,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295656286] [2024-12-02 14:58:46,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295656286] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:46,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:58:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014737471] [2024-12-02 14:58:46,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:46,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:58:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:46,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:58:46,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:58:46,655 INFO L87 Difference]: Start difference. First operand 808 states and 1527 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:46,768 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2024-12-02 14:58:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:58:46,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-12-02 14:58:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:46,772 INFO L225 Difference]: With dead ends: 844 [2024-12-02 14:58:46,773 INFO L226 Difference]: Without dead ends: 808 [2024-12-02 14:58:46,773 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-12-02 14:58:46,774 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:46,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-12-02 14:58:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-12-02 14:58:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8746898263027296) internal successors, (1511), 807 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2024-12-02 14:58:46,804 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2024-12-02 14:58:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:46,804 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2024-12-02 14:58:46,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2024-12-02 14:58:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-02 14:58:46,806 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:46,806 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] [2024-12-02 14:58:46,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:58:46,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:46,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1226597962, now seen corresponding path program 1 times [2024-12-02 14:58:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:46,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788597990] [2024-12-02 14:58:46,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:46,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788597990] [2024-12-02 14:58:46,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788597990] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:46,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:58:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36799306] [2024-12-02 14:58:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:46,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:58:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:46,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:58:46,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:58:46,953 INFO L87 Difference]: Start difference. First operand 808 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:47,097 INFO L93 Difference]: Finished difference Result 1000 states and 1811 transitions. [2024-12-02 14:58:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:58:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-12-02 14:58:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:47,103 INFO L225 Difference]: With dead ends: 1000 [2024-12-02 14:58:47,103 INFO L226 Difference]: Without dead ends: 968 [2024-12-02 14:58:47,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:58:47,105 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 4682 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:47,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 1758 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:58:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-12-02 14:58:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 838. [2024-12-02 14:58:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.8636363636363635) internal successors, (1558), 837 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1558 transitions. [2024-12-02 14:58:47,138 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1558 transitions. Word has length 35 [2024-12-02 14:58:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:47,138 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1558 transitions. [2024-12-02 14:58:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1558 transitions. [2024-12-02 14:58:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 14:58:47,140 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:47,140 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] [2024-12-02 14:58:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:58:47,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:47,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash 523901274, now seen corresponding path program 1 times [2024-12-02 14:58:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128394065] [2024-12-02 14:58:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:47,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:47,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128394065] [2024-12-02 14:58:47,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128394065] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:47,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:47,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:47,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48310608] [2024-12-02 14:58:47,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:47,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:47,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:47,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:47,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:47,237 INFO L87 Difference]: Start difference. First operand 838 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:47,288 INFO L93 Difference]: Finished difference Result 951 states and 1733 transitions. [2024-12-02 14:58:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:47,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-12-02 14:58:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:47,293 INFO L225 Difference]: With dead ends: 951 [2024-12-02 14:58:47,294 INFO L226 Difference]: Without dead ends: 889 [2024-12-02 14:58:47,294 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-12-02 14:58:47,295 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:47,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-12-02 14:58:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 885. [2024-12-02 14:58:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8437146092865233) internal successors, (1628), 884 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1628 transitions. [2024-12-02 14:58:47,328 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1628 transitions. Word has length 37 [2024-12-02 14:58:47,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:47,329 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1628 transitions. [2024-12-02 14:58:47,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1628 transitions. [2024-12-02 14:58:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 14:58:47,330 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:47,330 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] [2024-12-02 14:58:47,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:58:47,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:47,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash 590394786, now seen corresponding path program 1 times [2024-12-02 14:58:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453092203] [2024-12-02 14:58:47,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:47,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453092203] [2024-12-02 14:58:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453092203] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:47,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:58:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75121820] [2024-12-02 14:58:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:47,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:58:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:47,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:58:47,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:58:47,514 INFO L87 Difference]: Start difference. First operand 885 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:47,601 INFO L93 Difference]: Finished difference Result 996 states and 1796 transitions. [2024-12-02 14:58:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:58:47,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-12-02 14:58:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:47,605 INFO L225 Difference]: With dead ends: 996 [2024-12-02 14:58:47,605 INFO L226 Difference]: Without dead ends: 887 [2024-12-02 14:58:47,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:58:47,607 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 2952 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:47,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 1598 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-12-02 14:58:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2024-12-02 14:58:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8414496036240091) internal successors, (1626), 884 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1626 transitions. [2024-12-02 14:58:47,630 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1626 transitions. Word has length 37 [2024-12-02 14:58:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:47,630 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1626 transitions. [2024-12-02 14:58:47,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1626 transitions. [2024-12-02 14:58:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 14:58:47,631 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:47,631 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] [2024-12-02 14:58:47,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:58:47,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:47,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash 707645968, now seen corresponding path program 1 times [2024-12-02 14:58:47,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794749832] [2024-12-02 14:58:47,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:47,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:47,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:47,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794749832] [2024-12-02 14:58:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794749832] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:47,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 14:58:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959516602] [2024-12-02 14:58:47,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:47,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 14:58:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:47,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 14:58:47,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:58:47,897 INFO L87 Difference]: Start difference. First operand 885 states and 1626 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:47,982 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions. [2024-12-02 14:58:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 14:58:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-12-02 14:58:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:47,986 INFO L225 Difference]: With dead ends: 893 [2024-12-02 14:58:47,987 INFO L226 Difference]: Without dead ends: 891 [2024-12-02 14:58:47,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:58:47,988 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:47,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-12-02 14:58:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2024-12-02 14:58:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.8346456692913387) internal successors, (1631), 890 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1631 transitions. [2024-12-02 14:58:48,012 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1631 transitions. Word has length 38 [2024-12-02 14:58:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:48,012 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1631 transitions. [2024-12-02 14:58:48,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1631 transitions. [2024-12-02 14:58:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 14:58:48,013 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:48,013 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] [2024-12-02 14:58:48,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:58:48,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:48,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1903217474, now seen corresponding path program 1 times [2024-12-02 14:58:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856804131] [2024-12-02 14:58:48,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:48,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856804131] [2024-12-02 14:58:48,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856804131] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:48,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:48,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703707914] [2024-12-02 14:58:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:48,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:48,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:48,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:48,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:48,060 INFO L87 Difference]: Start difference. First operand 891 states and 1631 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:48,090 INFO L93 Difference]: Finished difference Result 1105 states and 1943 transitions. [2024-12-02 14:58:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:48,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-12-02 14:58:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:48,094 INFO L225 Difference]: With dead ends: 1105 [2024-12-02 14:58:48,094 INFO L226 Difference]: Without dead ends: 990 [2024-12-02 14:58:48,095 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-12-02 14:58:48,096 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:48,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1587 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-12-02 14:58:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2024-12-02 14:58:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 986 states have (on average 1.793103448275862) internal successors, (1768), 987 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1768 transitions. [2024-12-02 14:58:48,121 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1768 transitions. Word has length 39 [2024-12-02 14:58:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:48,121 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1768 transitions. [2024-12-02 14:58:48,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1768 transitions. [2024-12-02 14:58:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 14:58:48,122 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:48,122 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] [2024-12-02 14:58:48,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:58:48,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:48,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash 122284610, now seen corresponding path program 1 times [2024-12-02 14:58:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:48,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771380496] [2024-12-02 14:58:48,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:48,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771380496] [2024-12-02 14:58:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771380496] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:48,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:48,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405688616] [2024-12-02 14:58:48,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:48,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:48,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:48,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:48,170 INFO L87 Difference]: Start difference. First operand 988 states and 1768 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:48,197 INFO L93 Difference]: Finished difference Result 1380 states and 2326 transitions. [2024-12-02 14:58:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-12-02 14:58:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:48,202 INFO L225 Difference]: With dead ends: 1380 [2024-12-02 14:58:48,202 INFO L226 Difference]: Without dead ends: 1168 [2024-12-02 14:58:48,203 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-12-02 14:58:48,203 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:48,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-12-02 14:58:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2024-12-02 14:58:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1164 states have (on average 1.7268041237113403) internal successors, (2010), 1165 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 2010 transitions. [2024-12-02 14:58:48,235 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 2010 transitions. Word has length 39 [2024-12-02 14:58:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:48,236 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 2010 transitions. [2024-12-02 14:58:48,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2010 transitions. [2024-12-02 14:58:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 14:58:48,236 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:48,236 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] [2024-12-02 14:58:48,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:58:48,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:48,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1688735299, now seen corresponding path program 1 times [2024-12-02 14:58:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:48,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007936486] [2024-12-02 14:58:48,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:48,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:48,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007936486] [2024-12-02 14:58:48,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007936486] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:48,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:48,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:48,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133509642] [2024-12-02 14:58:48,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:48,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:48,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:48,282 INFO L87 Difference]: Start difference. First operand 1166 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:48,316 INFO L93 Difference]: Finished difference Result 1589 states and 2616 transitions. [2024-12-02 14:58:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-12-02 14:58:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:48,321 INFO L225 Difference]: With dead ends: 1589 [2024-12-02 14:58:48,321 INFO L226 Difference]: Without dead ends: 1354 [2024-12-02 14:58:48,322 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-12-02 14:58:48,323 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:48,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-12-02 14:58:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2024-12-02 14:58:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1350 states have (on average 1.677037037037037) internal successors, (2264), 1351 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2264 transitions. [2024-12-02 14:58:48,360 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2264 transitions. Word has length 41 [2024-12-02 14:58:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:48,360 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2264 transitions. [2024-12-02 14:58:48,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2264 transitions. [2024-12-02 14:58:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 14:58:48,361 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:48,361 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:58:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:58:48,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:48,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 923003988, now seen corresponding path program 1 times [2024-12-02 14:58:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901250584] [2024-12-02 14:58:48,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 14:58:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901250584] [2024-12-02 14:58:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901250584] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:48,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:48,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:58:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430082829] [2024-12-02 14:58:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:48,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:58:48,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:48,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:58:48,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:58:48,481 INFO L87 Difference]: Start difference. First operand 1352 states and 2264 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:48,587 INFO L93 Difference]: Finished difference Result 3208 states and 4844 transitions. [2024-12-02 14:58:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:58:48,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-12-02 14:58:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:48,596 INFO L225 Difference]: With dead ends: 3208 [2024-12-02 14:58:48,597 INFO L226 Difference]: Without dead ends: 2634 [2024-12-02 14:58:48,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:58:48,599 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 3057 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3057 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:48,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3057 Valid, 3155 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2024-12-02 14:58:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1924. [2024-12-02 14:58:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1922 states have (on average 1.5879292403746097) internal successors, (3052), 1923 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3052 transitions. [2024-12-02 14:58:48,662 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3052 transitions. Word has length 54 [2024-12-02 14:58:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:48,662 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 3052 transitions. [2024-12-02 14:58:48,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3052 transitions. [2024-12-02 14:58:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 14:58:48,663 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:48,663 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:58:48,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:58:48,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:48,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash -857928876, now seen corresponding path program 1 times [2024-12-02 14:58:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:48,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973649770] [2024-12-02 14:58:48,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 14:58:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973649770] [2024-12-02 14:58:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973649770] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:58:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592128830] [2024-12-02 14:58:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:48,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:58:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:48,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:58:48,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:58:48,777 INFO L87 Difference]: Start difference. First operand 1924 states and 3052 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:48,890 INFO L93 Difference]: Finished difference Result 3780 states and 5632 transitions. [2024-12-02 14:58:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:58:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-12-02 14:58:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:48,901 INFO L225 Difference]: With dead ends: 3780 [2024-12-02 14:58:48,902 INFO L226 Difference]: Without dead ends: 3206 [2024-12-02 14:58:48,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:58:48,904 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3049 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:48,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3049 Valid, 3170 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2024-12-02 14:58:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2784. [2024-12-02 14:58:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 1.518332135154565) internal successors, (4224), 2783 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4224 transitions. [2024-12-02 14:58:48,989 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4224 transitions. Word has length 54 [2024-12-02 14:58:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:48,989 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4224 transitions. [2024-12-02 14:58:48,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4224 transitions. [2024-12-02 14:58:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-02 14:58:48,990 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:48,990 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:58:48,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:58:48,991 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:48,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash 894361900, now seen corresponding path program 1 times [2024-12-02 14:58:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:48,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139279512] [2024-12-02 14:58:48,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:49,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:49,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139279512] [2024-12-02 14:58:49,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139279512] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:49,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:49,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:49,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462809693] [2024-12-02 14:58:49,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:49,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:49,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:49,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:49,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:49,079 INFO L87 Difference]: Start difference. First operand 2784 states and 4224 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:49,120 INFO L93 Difference]: Finished difference Result 4260 states and 6287 transitions. [2024-12-02 14:58:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-12-02 14:58:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:49,128 INFO L225 Difference]: With dead ends: 4260 [2024-12-02 14:58:49,128 INFO L226 Difference]: Without dead ends: 2254 [2024-12-02 14:58:49,130 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-12-02 14:58:49,131 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:49,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2024-12-02 14:58:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2024-12-02 14:58:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2250 states have (on average 1.5537777777777777) internal successors, (3496), 2251 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3496 transitions. [2024-12-02 14:58:49,186 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3496 transitions. Word has length 56 [2024-12-02 14:58:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:49,186 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3496 transitions. [2024-12-02 14:58:49,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3496 transitions. [2024-12-02 14:58:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-02 14:58:49,187 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:49,187 INFO L218 NwaCegarLoop]: trace histogram [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-12-02 14:58:49,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 14:58:49,187 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:49,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1218909775, now seen corresponding path program 1 times [2024-12-02 14:58:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:49,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191972769] [2024-12-02 14:58:49,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 14:58:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:49,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191972769] [2024-12-02 14:58:49,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191972769] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:49,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:49,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:58:49,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077792112] [2024-12-02 14:58:49,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:49,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:58:49,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:49,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:58:49,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:58:49,285 INFO L87 Difference]: Start difference. First operand 2252 states and 3496 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:49,383 INFO L93 Difference]: Finished difference Result 3508 states and 5252 transitions. [2024-12-02 14:58:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:58:49,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-12-02 14:58:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:49,419 INFO L225 Difference]: With dead ends: 3508 [2024-12-02 14:58:49,419 INFO L226 Difference]: Without dead ends: 3090 [2024-12-02 14:58:49,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:58:49,420 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 3051 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:49,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3147 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2024-12-02 14:58:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2668. [2024-12-02 14:58:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5273818454613652) internal successors, (4072), 2667 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4072 transitions. [2024-12-02 14:58:49,465 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4072 transitions. Word has length 56 [2024-12-02 14:58:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:49,465 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4072 transitions. [2024-12-02 14:58:49,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4072 transitions. [2024-12-02 14:58:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-02 14:58:49,466 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:49,466 INFO L218 NwaCegarLoop]: trace histogram [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-12-02 14:58:49,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 14:58:49,466 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:49,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash -877348108, now seen corresponding path program 1 times [2024-12-02 14:58:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:49,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989705189] [2024-12-02 14:58:49,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:49,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:49,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989705189] [2024-12-02 14:58:49,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989705189] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:49,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:49,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819838756] [2024-12-02 14:58:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:49,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:49,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:49,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:49,531 INFO L87 Difference]: Start difference. First operand 2668 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:49,558 INFO L93 Difference]: Finished difference Result 3608 states and 5370 transitions. [2024-12-02 14:58:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:49,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-12-02 14:58:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:49,562 INFO L225 Difference]: With dead ends: 3608 [2024-12-02 14:58:49,562 INFO L226 Difference]: Without dead ends: 1734 [2024-12-02 14:58:49,563 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-12-02 14:58:49,564 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:49,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-12-02 14:58:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2024-12-02 14:58:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.5942196531791908) internal successors, (2758), 1731 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2758 transitions. [2024-12-02 14:58:49,592 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2758 transitions. Word has length 57 [2024-12-02 14:58:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:49,592 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2758 transitions. [2024-12-02 14:58:49,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2758 transitions. [2024-12-02 14:58:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 14:58:49,592 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:49,593 INFO L218 NwaCegarLoop]: trace histogram [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-12-02 14:58:49,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 14:58:49,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1226511174, now seen corresponding path program 1 times [2024-12-02 14:58:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98902123] [2024-12-02 14:58:49,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98902123] [2024-12-02 14:58:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98902123] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:49,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:49,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72335008] [2024-12-02 14:58:49,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:49,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:58:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:49,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:58:49,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:58:49,654 INFO L87 Difference]: Start difference. First operand 1732 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:49,677 INFO L93 Difference]: Finished difference Result 2204 states and 3399 transitions. [2024-12-02 14:58:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:58:49,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-12-02 14:58:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:49,681 INFO L225 Difference]: With dead ends: 2204 [2024-12-02 14:58:49,681 INFO L226 Difference]: Without dead ends: 1266 [2024-12-02 14:58:49,682 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-12-02 14:58:49,683 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:49,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:58:49,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-12-02 14:58:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2024-12-02 14:58:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1262 states have (on average 1.6719492868462758) internal successors, (2110), 1263 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2110 transitions. [2024-12-02 14:58:49,705 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2110 transitions. Word has length 59 [2024-12-02 14:58:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:49,706 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2110 transitions. [2024-12-02 14:58:49,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2110 transitions. [2024-12-02 14:58:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 14:58:49,707 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:49,707 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] [2024-12-02 14:58:49,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 14:58:49,707 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:49,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1918634021, now seen corresponding path program 1 times [2024-12-02 14:58:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:49,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567671119] [2024-12-02 14:58:49,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:49,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567671119] [2024-12-02 14:58:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567671119] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:58:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:58:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:58:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853205742] [2024-12-02 14:58:49,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:58:49,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:58:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:49,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:58:49,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:58:49,802 INFO L87 Difference]: Start difference. First operand 1264 states and 2110 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:55,401 INFO L93 Difference]: Finished difference Result 3519 states and 6419 transitions. [2024-12-02 14:58:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:58:55,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-12-02 14:58:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:55,407 INFO L225 Difference]: With dead ends: 3519 [2024-12-02 14:58:55,407 INFO L226 Difference]: Without dead ends: 2766 [2024-12-02 14:58:55,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-02 14:58:55,409 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 2325 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:55,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 783 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-12-02 14:58:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2024-12-02 14:58:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2766. [2024-12-02 14:58:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2764 states have (on average 1.5325615050651231) internal successors, (4236), 2765 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4236 transitions. [2024-12-02 14:58:55,467 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4236 transitions. Word has length 60 [2024-12-02 14:58:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:55,467 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4236 transitions. [2024-12-02 14:58:55,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4236 transitions. [2024-12-02 14:58:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 14:58:55,468 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:55,468 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:58:55,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 14:58:55,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:55,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1826022888, now seen corresponding path program 1 times [2024-12-02 14:58:55,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:55,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799731538] [2024-12-02 14:58:55,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:55,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:58:56,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:58:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799731538] [2024-12-02 14:58:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799731538] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:58:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890224573] [2024-12-02 14:58:56,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:56,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:58:56,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:58:56,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:58:56,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:58:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:58:57,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-02 14:58:57,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:58:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 14:58:57,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:58:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 14:58:57,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890224573] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:58:57,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:58:57,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2024-12-02 14:58:57,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095218285] [2024-12-02 14:58:57,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:58:57,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 14:58:57,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:58:57,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 14:58:57,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-12-02 14:58:57,473 INFO L87 Difference]: Start difference. First operand 2766 states and 4236 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:58:59,288 INFO L93 Difference]: Finished difference Result 5167 states and 7410 transitions. [2024-12-02 14:58:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-12-02 14:58:59,289 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 14:58:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:58:59,296 INFO L225 Difference]: With dead ends: 5167 [2024-12-02 14:58:59,296 INFO L226 Difference]: Without dead ends: 4697 [2024-12-02 14:58:59,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2024-12-02 14:58:59,298 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 15751 mSDsluCounter, 7677 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15751 SdHoareTripleChecker+Valid, 9176 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:58:59,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15751 Valid, 9176 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:58:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2024-12-02 14:58:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 4663. [2024-12-02 14:58:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4663 states, 4661 states have (on average 1.4119287706500752) internal successors, (6581), 4662 states have internal predecessors, (6581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 6581 transitions. [2024-12-02 14:58:59,391 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 6581 transitions. Word has length 61 [2024-12-02 14:58:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:58:59,391 INFO L471 AbstractCegarLoop]: Abstraction has 4663 states and 6581 transitions. [2024-12-02 14:58:59,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:58:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 6581 transitions. [2024-12-02 14:58:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 14:58:59,393 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:58:59,393 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:58:59,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:58:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 14:58:59,594 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:58:59,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:58:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 459765187, now seen corresponding path program 1 times [2024-12-02 14:58:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:58:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770691295] [2024-12-02 14:58:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:58:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:58:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770691295] [2024-12-02 14:59:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770691295] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:59:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741163832] [2024-12-02 14:59:01,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:01,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:01,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:59:01,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:59:01,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:59:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:01,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 14:59:01,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:59:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:01,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:59:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741163832] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:59:02,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:59:02,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-12-02 14:59:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755849890] [2024-12-02 14:59:02,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:59:02,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-12-02 14:59:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:02,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-12-02 14:59:02,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-12-02 14:59:02,460 INFO L87 Difference]: Start difference. First operand 4663 states and 6581 transitions. Second operand has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:03,025 INFO L93 Difference]: Finished difference Result 8770 states and 11771 transitions. [2024-12-02 14:59:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 14:59:03,026 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-12-02 14:59:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:03,041 INFO L225 Difference]: With dead ends: 8770 [2024-12-02 14:59:03,041 INFO L226 Difference]: Without dead ends: 6811 [2024-12-02 14:59:03,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2024-12-02 14:59:03,045 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 11997 mSDsluCounter, 4808 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11997 SdHoareTripleChecker+Valid, 6303 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:03,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11997 Valid, 6303 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:59:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2024-12-02 14:59:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 6745. [2024-12-02 14:59:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6745 states, 6743 states have (on average 1.3510306985021503) internal successors, (9110), 6744 states have internal predecessors, (9110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6745 states to 6745 states and 9110 transitions. [2024-12-02 14:59:03,176 INFO L78 Accepts]: Start accepts. Automaton has 6745 states and 9110 transitions. Word has length 62 [2024-12-02 14:59:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:03,176 INFO L471 AbstractCegarLoop]: Abstraction has 6745 states and 9110 transitions. [2024-12-02 14:59:03,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6745 states and 9110 transitions. [2024-12-02 14:59:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 14:59:03,177 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:03,177 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:59:03,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:59:03,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 14:59:03,378 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:03,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1147902773, now seen corresponding path program 1 times [2024-12-02 14:59:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363590948] [2024-12-02 14:59:03,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:03,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:03,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363590948] [2024-12-02 14:59:03,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363590948] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:59:03,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914169965] [2024-12-02 14:59:03,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:03,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:03,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:59:03,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:59:03,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:59:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:03,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 14:59:03,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:59:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:04,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:59:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914169965] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:59:05,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:59:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-12-02 14:59:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379043914] [2024-12-02 14:59:05,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:59:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:59:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:05,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:59:05,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:59:05,198 INFO L87 Difference]: Start difference. First operand 6745 states and 9110 transitions. Second operand has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:07,993 INFO L93 Difference]: Finished difference Result 14766 states and 19170 transitions. [2024-12-02 14:59:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-12-02 14:59:07,994 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-12-02 14:59:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:08,008 INFO L225 Difference]: With dead ends: 14766 [2024-12-02 14:59:08,008 INFO L226 Difference]: Without dead ends: 10806 [2024-12-02 14:59:08,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-12-02 14:59:08,014 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 21870 mSDsluCounter, 13915 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21870 SdHoareTripleChecker+Valid, 15423 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:08,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21870 Valid, 15423 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:59:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10806 states. [2024-12-02 14:59:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10806 to 7404. [2024-12-02 14:59:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 7402 states have (on average 1.3409889219129965) internal successors, (9926), 7403 states have internal predecessors, (9926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 9926 transitions. [2024-12-02 14:59:08,184 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 9926 transitions. Word has length 62 [2024-12-02 14:59:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:08,184 INFO L471 AbstractCegarLoop]: Abstraction has 7404 states and 9926 transitions. [2024-12-02 14:59:08,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 9926 transitions. [2024-12-02 14:59:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 14:59:08,185 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:08,185 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:59:08,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 14:59:08,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:08,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:08,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 807603108, now seen corresponding path program 1 times [2024-12-02 14:59:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447133519] [2024-12-02 14:59:08,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447133519] [2024-12-02 14:59:08,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447133519] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:59:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846085448] [2024-12-02 14:59:08,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:08,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:59:08,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:59:08,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:59:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:08,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 14:59:08,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:59:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:10,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:59:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:10,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846085448] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:59:10,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:59:10,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-12-02 14:59:10,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479219974] [2024-12-02 14:59:10,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:59:10,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 14:59:10,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:10,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 14:59:10,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-12-02 14:59:10,915 INFO L87 Difference]: Start difference. First operand 7404 states and 9926 transitions. Second operand has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:12,481 INFO L93 Difference]: Finished difference Result 14054 states and 18229 transitions. [2024-12-02 14:59:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 14:59:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 14:59:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:12,491 INFO L225 Difference]: With dead ends: 14054 [2024-12-02 14:59:12,491 INFO L226 Difference]: Without dead ends: 9740 [2024-12-02 14:59:12,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=637, Invalid=2015, Unknown=0, NotChecked=0, Total=2652 [2024-12-02 14:59:12,494 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 15577 mSDsluCounter, 7947 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15577 SdHoareTripleChecker+Valid, 9461 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:12,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15577 Valid, 9461 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:59:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9740 states. [2024-12-02 14:59:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9740 to 9316. [2024-12-02 14:59:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9316 states, 9314 states have (on average 1.3110371483787846) internal successors, (12211), 9315 states have internal predecessors, (12211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 12211 transitions. [2024-12-02 14:59:12,707 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 12211 transitions. Word has length 63 [2024-12-02 14:59:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 9316 states and 12211 transitions. [2024-12-02 14:59:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 12211 transitions. [2024-12-02 14:59:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 14:59:12,708 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:12,708 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:59:12,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:59:12,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:12,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:12,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1786741782, now seen corresponding path program 1 times [2024-12-02 14:59:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302949797] [2024-12-02 14:59:12,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302949797] [2024-12-02 14:59:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302949797] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:59:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155713804] [2024-12-02 14:59:14,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:14,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:14,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:59:14,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:59:14,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:59:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:14,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 14:59:14,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:59:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:17,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:59:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:19,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155713804] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:59:19,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:59:19,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 15] total 51 [2024-12-02 14:59:19,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454410250] [2024-12-02 14:59:19,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:59:19,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-12-02 14:59:19,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:19,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-12-02 14:59:19,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2308, Unknown=0, NotChecked=0, Total=2550 [2024-12-02 14:59:19,009 INFO L87 Difference]: Start difference. First operand 9316 states and 12211 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:40,673 INFO L93 Difference]: Finished difference Result 16042 states and 20468 transitions. [2024-12-02 14:59:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-12-02 14:59:40,674 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 14:59:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:40,693 INFO L225 Difference]: With dead ends: 16042 [2024-12-02 14:59:40,693 INFO L226 Difference]: Without dead ends: 13203 [2024-12-02 14:59:40,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5729 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=4031, Invalid=15991, Unknown=0, NotChecked=0, Total=20022 [2024-12-02 14:59:40,701 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 25785 mSDsluCounter, 19298 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25785 SdHoareTripleChecker+Valid, 20834 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:40,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25785 Valid, 20834 Invalid, 2339 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [115 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 14:59:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2024-12-02 14:59:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 11387. [2024-12-02 14:59:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11387 states, 11385 states have (on average 1.2979358805445762) internal successors, (14777), 11386 states have internal predecessors, (14777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11387 states to 11387 states and 14777 transitions. [2024-12-02 14:59:41,270 INFO L78 Accepts]: Start accepts. Automaton has 11387 states and 14777 transitions. Word has length 63 [2024-12-02 14:59:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:41,270 INFO L471 AbstractCegarLoop]: Abstraction has 11387 states and 14777 transitions. [2024-12-02 14:59:41,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 11387 states and 14777 transitions. [2024-12-02 14:59:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 14:59:41,271 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:41,271 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:59:41,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:59:41,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-12-02 14:59:41,472 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:41,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash 532152701, now seen corresponding path program 1 times [2024-12-02 14:59:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:41,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649651984] [2024-12-02 14:59:41,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:42,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:42,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649651984] [2024-12-02 14:59:42,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649651984] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:59:42,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038631863] [2024-12-02 14:59:42,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:42,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:42,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:59:42,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:59:42,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:59:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:42,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 14:59:42,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:59:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:43,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:59:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:44,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038631863] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:59:44,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:59:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2024-12-02 14:59:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610820033] [2024-12-02 14:59:44,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:59:44,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 14:59:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:44,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 14:59:44,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 14:59:44,537 INFO L87 Difference]: Start difference. First operand 11387 states and 14777 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:59:47,172 INFO L93 Difference]: Finished difference Result 14885 states and 19054 transitions. [2024-12-02 14:59:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-12-02 14:59:47,172 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-12-02 14:59:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:59:47,189 INFO L225 Difference]: With dead ends: 14885 [2024-12-02 14:59:47,189 INFO L226 Difference]: Without dead ends: 11074 [2024-12-02 14:59:47,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=822, Invalid=2960, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 14:59:47,197 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 15889 mSDsluCounter, 11046 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15889 SdHoareTripleChecker+Valid, 12563 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 14:59:47,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15889 Valid, 12563 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 14:59:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2024-12-02 14:59:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 9456. [2024-12-02 14:59:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9456 states, 9454 states have (on average 1.3074888935900149) internal successors, (12361), 9455 states have internal predecessors, (12361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9456 states to 9456 states and 12361 transitions. [2024-12-02 14:59:47,593 INFO L78 Accepts]: Start accepts. Automaton has 9456 states and 12361 transitions. Word has length 64 [2024-12-02 14:59:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:59:47,593 INFO L471 AbstractCegarLoop]: Abstraction has 9456 states and 12361 transitions. [2024-12-02 14:59:47,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:59:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9456 states and 12361 transitions. [2024-12-02 14:59:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 14:59:47,594 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:59:47,594 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 14:59:47,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 14:59:47,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 14:59:47,794 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 14:59:47,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:59:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1624666796, now seen corresponding path program 1 times [2024-12-02 14:59:47,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:59:47,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450510025] [2024-12-02 14:59:47,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:59:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:49,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:59:49,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450510025] [2024-12-02 14:59:49,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450510025] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:59:49,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723630377] [2024-12-02 14:59:49,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:59:49,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:59:49,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:59:49,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:59:49,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:59:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:59:49,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-02 14:59:49,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:59:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:50,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:59:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:59:51,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723630377] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:59:51,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:59:51,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 42 [2024-12-02 14:59:51,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511055126] [2024-12-02 14:59:51,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:59:51,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-12-02 14:59:51,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:59:51,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-12-02 14:59:51,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 14:59:51,219 INFO L87 Difference]: Start difference. First operand 9456 states and 12361 transitions. Second operand has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:00:01,468 INFO L93 Difference]: Finished difference Result 23366 states and 29411 transitions. [2024-12-02 15:00:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-12-02 15:00:01,468 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-12-02 15:00:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:00:01,486 INFO L225 Difference]: With dead ends: 23366 [2024-12-02 15:00:01,486 INFO L226 Difference]: Without dead ends: 18935 [2024-12-02 15:00:01,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2435, Invalid=9121, Unknown=0, NotChecked=0, Total=11556 [2024-12-02 15:00:01,494 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 19829 mSDsluCounter, 27564 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19829 SdHoareTripleChecker+Valid, 29147 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:00:01,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19829 Valid, 29147 Invalid, 2751 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [79 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 15:00:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18935 states. [2024-12-02 15:00:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18935 to 6613. [2024-12-02 15:00:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6613 states, 6611 states have (on average 1.3477537437603992) internal successors, (8910), 6612 states have internal predecessors, (8910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6613 states to 6613 states and 8910 transitions. [2024-12-02 15:00:01,856 INFO L78 Accepts]: Start accepts. Automaton has 6613 states and 8910 transitions. Word has length 65 [2024-12-02 15:00:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:00:01,857 INFO L471 AbstractCegarLoop]: Abstraction has 6613 states and 8910 transitions. [2024-12-02 15:00:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6613 states and 8910 transitions. [2024-12-02 15:00:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 15:00:01,858 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:00:01,858 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-12-02 15:00:01,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 15:00:02,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:00:02,059 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:00:02,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:00:02,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1065912349, now seen corresponding path program 1 times [2024-12-02 15:00:02,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:00:02,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240415879] [2024-12-02 15:00:02,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:02,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:00:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 31 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:02,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:00:02,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240415879] [2024-12-02 15:00:02,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240415879] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:00:02,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106515747] [2024-12-02 15:00:02,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:02,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:00:02,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:00:02,781 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:00:02,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 15:00:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:02,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 15:00:02,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:00:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 33 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:03,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:00:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 31 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:05,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106515747] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:00:05,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:00:05,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-12-02 15:00:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537727844] [2024-12-02 15:00:05,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:00:05,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 15:00:05,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:00:05,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 15:00:05,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2024-12-02 15:00:05,004 INFO L87 Difference]: Start difference. First operand 6613 states and 8910 transitions. Second operand has 27 states, 27 states have (on average 8.333333333333334) internal successors, (225), 26 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:00:06,457 INFO L93 Difference]: Finished difference Result 16183 states and 20838 transitions. [2024-12-02 15:00:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 15:00:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.333333333333334) internal successors, (225), 26 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-12-02 15:00:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:00:06,464 INFO L225 Difference]: With dead ends: 16183 [2024-12-02 15:00:06,465 INFO L226 Difference]: Without dead ends: 12184 [2024-12-02 15:00:06,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 15:00:06,468 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 10477 mSDsluCounter, 12122 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10477 SdHoareTripleChecker+Valid, 13638 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:00:06,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10477 Valid, 13638 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 15:00:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12184 states. [2024-12-02 15:00:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12184 to 11364. [2024-12-02 15:00:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11364 states, 11362 states have (on average 1.288241506776976) internal successors, (14637), 11363 states have internal predecessors, (14637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11364 states to 11364 states and 14637 transitions. [2024-12-02 15:00:07,051 INFO L78 Accepts]: Start accepts. Automaton has 11364 states and 14637 transitions. Word has length 103 [2024-12-02 15:00:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:00:07,051 INFO L471 AbstractCegarLoop]: Abstraction has 11364 states and 14637 transitions. [2024-12-02 15:00:07,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.333333333333334) internal successors, (225), 26 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 11364 states and 14637 transitions. [2024-12-02 15:00:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 15:00:07,053 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:00:07,053 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 15:00:07,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 15:00:07,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 15:00:07,254 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:00:07,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:00:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1754049935, now seen corresponding path program 1 times [2024-12-02 15:00:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:00:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688340567] [2024-12-02 15:00:07,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:00:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:07,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:00:07,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688340567] [2024-12-02 15:00:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688340567] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:00:07,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026001495] [2024-12-02 15:00:07,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:07,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:00:07,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:00:07,751 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:00:07,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 15:00:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:07,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 15:00:07,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:00:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:08,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:00:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:09,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026001495] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:00:09,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:00:09,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-12-02 15:00:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347780057] [2024-12-02 15:00:09,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:00:09,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 15:00:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:00:09,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 15:00:09,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2024-12-02 15:00:09,989 INFO L87 Difference]: Start difference. First operand 11364 states and 14637 transitions. Second operand has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 26 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:00:11,192 INFO L93 Difference]: Finished difference Result 16074 states and 20401 transitions. [2024-12-02 15:00:11,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 15:00:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 26 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-12-02 15:00:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:00:11,200 INFO L225 Difference]: With dead ends: 16074 [2024-12-02 15:00:11,200 INFO L226 Difference]: Without dead ends: 10362 [2024-12-02 15:00:11,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 15:00:11,205 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 17824 mSDsluCounter, 12096 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17824 SdHoareTripleChecker+Valid, 13611 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 15:00:11,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17824 Valid, 13611 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 15:00:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10362 states. [2024-12-02 15:00:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10362 to 10270. [2024-12-02 15:00:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10270 states, 10268 states have (on average 1.2877873003506037) internal successors, (13223), 10269 states have internal predecessors, (13223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10270 states to 10270 states and 13223 transitions. [2024-12-02 15:00:11,725 INFO L78 Accepts]: Start accepts. Automaton has 10270 states and 13223 transitions. Word has length 103 [2024-12-02 15:00:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:00:11,725 INFO L471 AbstractCegarLoop]: Abstraction has 10270 states and 13223 transitions. [2024-12-02 15:00:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.037037037037036) internal successors, (217), 26 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 10270 states and 13223 transitions. [2024-12-02 15:00:11,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 15:00:11,726 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:00:11,727 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:00:11,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-12-02 15:00:11,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 15:00:11,927 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:00:11,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:00:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash 856710688, now seen corresponding path program 1 times [2024-12-02 15:00:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:00:11,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370787987] [2024-12-02 15:00:11,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:00:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-02 15:00:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:00:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370787987] [2024-12-02 15:00:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370787987] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:00:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043689999] [2024-12-02 15:00:13,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:13,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:00:13,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:00:13,049 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:00:13,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 15:00:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:13,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-02 15:00:13,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:00:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:14,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:00:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043689999] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:00:18,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:00:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-12-02 15:00:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011763355] [2024-12-02 15:00:18,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:00:18,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-12-02 15:00:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:00:18,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-12-02 15:00:18,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2423, Unknown=0, NotChecked=0, Total=2652 [2024-12-02 15:00:18,491 INFO L87 Difference]: Start difference. First operand 10270 states and 13223 transitions. Second operand has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:00:28,757 INFO L93 Difference]: Finished difference Result 15968 states and 20092 transitions. [2024-12-02 15:00:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-12-02 15:00:28,758 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-12-02 15:00:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:00:28,765 INFO L225 Difference]: With dead ends: 15968 [2024-12-02 15:00:28,765 INFO L226 Difference]: Without dead ends: 10438 [2024-12-02 15:00:28,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3017 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1975, Invalid=10907, Unknown=0, NotChecked=0, Total=12882 [2024-12-02 15:00:28,769 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 26037 mSDsluCounter, 29098 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26037 SdHoareTripleChecker+Valid, 30607 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:00:28,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26037 Valid, 30607 Invalid, 2104 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [114 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 15:00:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10438 states. [2024-12-02 15:00:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10438 to 9954. [2024-12-02 15:00:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9954 states, 9952 states have (on average 1.291298231511254) internal successors, (12851), 9953 states have internal predecessors, (12851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9954 states to 9954 states and 12851 transitions. [2024-12-02 15:00:29,428 INFO L78 Accepts]: Start accepts. Automaton has 9954 states and 12851 transitions. Word has length 104 [2024-12-02 15:00:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:00:29,429 INFO L471 AbstractCegarLoop]: Abstraction has 9954 states and 12851 transitions. [2024-12-02 15:00:29,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.173076923076923) internal successors, (269), 52 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9954 states and 12851 transitions. [2024-12-02 15:00:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 15:00:29,431 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:00:29,431 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2024-12-02 15:00:29,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 15:00:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 15:00:29,631 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:00:29,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:00:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 15634770, now seen corresponding path program 1 times [2024-12-02 15:00:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:00:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354567326] [2024-12-02 15:00:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:00:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:00:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354567326] [2024-12-02 15:00:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354567326] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:00:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461082812] [2024-12-02 15:00:30,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:30,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:00:30,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:00:30,305 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:00:30,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 15:00:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:30,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-02 15:00:30,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:00:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:31,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:00:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:34,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461082812] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:00:34,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:00:34,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2024-12-02 15:00:34,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305229464] [2024-12-02 15:00:34,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:00:34,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 15:00:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:00:34,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 15:00:34,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2024-12-02 15:00:34,180 INFO L87 Difference]: Start difference. First operand 9954 states and 12851 transitions. Second operand has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:00:39,526 INFO L93 Difference]: Finished difference Result 21336 states and 26725 transitions. [2024-12-02 15:00:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-12-02 15:00:39,526 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-12-02 15:00:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:00:39,536 INFO L225 Difference]: With dead ends: 21336 [2024-12-02 15:00:39,536 INFO L226 Difference]: Without dead ends: 14260 [2024-12-02 15:00:39,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1986, Invalid=8726, Unknown=0, NotChecked=0, Total=10712 [2024-12-02 15:00:39,541 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 25647 mSDsluCounter, 12040 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25647 SdHoareTripleChecker+Valid, 13663 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:00:39,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25647 Valid, 13663 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 15:00:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14260 states. [2024-12-02 15:00:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14260 to 6134. [2024-12-02 15:00:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6132 states have (on average 1.3396934116112198) internal successors, (8215), 6133 states have internal predecessors, (8215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8215 transitions. [2024-12-02 15:00:39,929 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8215 transitions. Word has length 104 [2024-12-02 15:00:39,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:00:39,930 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 8215 transitions. [2024-12-02 15:00:39,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:00:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8215 transitions. [2024-12-02 15:00:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 15:00:39,931 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:00:39,931 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2024-12-02 15:00:39,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 15:00:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 15:00:40,131 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:00:40,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:00:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1395528875, now seen corresponding path program 1 times [2024-12-02 15:00:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:00:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255148302] [2024-12-02 15:00:40,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:00:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:41,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:00:41,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255148302] [2024-12-02 15:00:41,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255148302] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:00:41,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515860830] [2024-12-02 15:00:41,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:00:41,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:00:41,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:00:41,048 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:00:41,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 15:00:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:00:41,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-02 15:00:41,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:00:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:42,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:00:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:00:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515860830] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:00:45,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:00:45,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 53 [2024-12-02 15:00:45,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593788626] [2024-12-02 15:00:45,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:00:45,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-12-02 15:00:45,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:00:45,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-12-02 15:00:45,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2526, Unknown=0, NotChecked=0, Total=2756 [2024-12-02 15:00:45,880 INFO L87 Difference]: Start difference. First operand 6134 states and 8215 transitions. Second operand has 53 states, 53 states have (on average 5.377358490566038) internal successors, (285), 53 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:01:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:01:27,267 INFO L93 Difference]: Finished difference Result 17177 states and 21392 transitions. [2024-12-02 15:01:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2024-12-02 15:01:27,268 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.377358490566038) internal successors, (285), 53 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-12-02 15:01:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:01:27,276 INFO L225 Difference]: With dead ends: 17177 [2024-12-02 15:01:27,277 INFO L226 Difference]: Without dead ends: 15214 [2024-12-02 15:01:27,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24928 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=12162, Invalid=59930, Unknown=0, NotChecked=0, Total=72092 [2024-12-02 15:01:27,282 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 22201 mSDsluCounter, 37252 mSDsCounter, 0 mSdLazyCounter, 3357 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22201 SdHoareTripleChecker+Valid, 38853 SdHoareTripleChecker+Invalid, 3572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 3357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-12-02 15:01:27,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22201 Valid, 38853 Invalid, 3572 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [215 Valid, 3357 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-12-02 15:01:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15214 states. [2024-12-02 15:01:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15214 to 12084. [2024-12-02 15:01:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12084 states, 12082 states have (on average 1.2689951994702864) internal successors, (15332), 12083 states have internal predecessors, (15332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:01:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12084 states to 12084 states and 15332 transitions. [2024-12-02 15:01:28,228 INFO L78 Accepts]: Start accepts. Automaton has 12084 states and 15332 transitions. Word has length 105 [2024-12-02 15:01:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:01:28,229 INFO L471 AbstractCegarLoop]: Abstraction has 12084 states and 15332 transitions. [2024-12-02 15:01:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.377358490566038) internal successors, (285), 53 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:01:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12084 states and 15332 transitions. [2024-12-02 15:01:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 15:01:28,230 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:01:28,230 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2024-12-02 15:01:28,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 15:01:28,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 15:01:28,430 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:01:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:01:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1322155965, now seen corresponding path program 1 times [2024-12-02 15:01:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:01:28,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3397010] [2024-12-02 15:01:28,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:01:28,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:01:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:01:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:01:29,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:01:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3397010] [2024-12-02 15:01:29,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3397010] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:01:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126666975] [2024-12-02 15:01:29,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:01:29,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:01:29,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:01:29,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:01:29,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 15:01:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:01:29,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-02 15:01:29,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:01:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:01:34,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:01:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:01:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126666975] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:01:42,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:01:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 32, 27] total 76 [2024-12-02 15:01:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933454652] [2024-12-02 15:01:42,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:01:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-12-02 15:01:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:01:42,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-12-02 15:01:42,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=5073, Unknown=0, NotChecked=0, Total=5700 [2024-12-02 15:01:42,041 INFO L87 Difference]: Start difference. First operand 12084 states and 15332 transitions. Second operand has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:02:16,417 INFO L93 Difference]: Finished difference Result 20090 states and 25106 transitions. [2024-12-02 15:02:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-12-02 15:02:16,418 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-12-02 15:02:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:02:16,428 INFO L225 Difference]: With dead ends: 20090 [2024-12-02 15:02:16,428 INFO L226 Difference]: Without dead ends: 15952 [2024-12-02 15:02:16,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12702 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=6924, Invalid=33276, Unknown=0, NotChecked=0, Total=40200 [2024-12-02 15:02:16,432 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 24236 mSDsluCounter, 27402 mSDsCounter, 0 mSdLazyCounter, 3488 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24236 SdHoareTripleChecker+Valid, 28962 SdHoareTripleChecker+Invalid, 3680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 3488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:02:16,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24236 Valid, 28962 Invalid, 3680 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [192 Valid, 3488 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 15:02:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15952 states. [2024-12-02 15:02:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15952 to 15181. [2024-12-02 15:02:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15181 states, 15179 states have (on average 1.254232821661506) internal successors, (19038), 15180 states have internal predecessors, (19038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15181 states to 15181 states and 19038 transitions. [2024-12-02 15:02:17,792 INFO L78 Accepts]: Start accepts. Automaton has 15181 states and 19038 transitions. Word has length 105 [2024-12-02 15:02:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:02:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 15181 states and 19038 transitions. [2024-12-02 15:02:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 15181 states and 19038 transitions. [2024-12-02 15:02:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 15:02:17,794 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:02:17,794 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2024-12-02 15:02:17,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 15:02:17,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 15:02:17,994 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:02:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:02:17,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1973850741, now seen corresponding path program 1 times [2024-12-02 15:02:17,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:02:17,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356235095] [2024-12-02 15:02:17,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:02:17,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:02:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:02:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:02:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:02:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356235095] [2024-12-02 15:02:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356235095] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:02:19,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838424610] [2024-12-02 15:02:19,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:02:19,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:02:19,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:02:19,042 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:02:19,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 15:02:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:02:19,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 15:02:19,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:02:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:02:20,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:02:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:02:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838424610] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:02:24,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:02:24,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 21] total 59 [2024-12-02 15:02:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616945990] [2024-12-02 15:02:24,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:02:24,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-12-02 15:02:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:02:24,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-12-02 15:02:24,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3177, Unknown=0, NotChecked=0, Total=3422 [2024-12-02 15:02:24,558 INFO L87 Difference]: Start difference. First operand 15181 states and 19038 transitions. Second operand has 59 states, 59 states have (on average 4.915254237288136) internal successors, (290), 59 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:02:41,890 INFO L93 Difference]: Finished difference Result 31457 states and 38468 transitions. [2024-12-02 15:02:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-12-02 15:02:41,891 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 4.915254237288136) internal successors, (290), 59 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-12-02 15:02:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:02:41,905 INFO L225 Difference]: With dead ends: 31457 [2024-12-02 15:02:41,905 INFO L226 Difference]: Without dead ends: 23596 [2024-12-02 15:02:41,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5470 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=3809, Invalid=18541, Unknown=0, NotChecked=0, Total=22350 [2024-12-02 15:02:41,911 INFO L435 NwaCegarLoop]: 1619 mSDtfsCounter, 22582 mSDsluCounter, 38418 mSDsCounter, 0 mSdLazyCounter, 3041 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22582 SdHoareTripleChecker+Valid, 40037 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:02:41,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22582 Valid, 40037 Invalid, 3174 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [133 Valid, 3041 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 15:02:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23596 states. [2024-12-02 15:02:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23596 to 15203. [2024-12-02 15:02:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15203 states, 15201 states have (on average 1.2512334714821394) internal successors, (19020), 15202 states have internal predecessors, (19020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15203 states to 15203 states and 19020 transitions. [2024-12-02 15:02:43,470 INFO L78 Accepts]: Start accepts. Automaton has 15203 states and 19020 transitions. Word has length 105 [2024-12-02 15:02:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:02:43,470 INFO L471 AbstractCegarLoop]: Abstraction has 15203 states and 19020 transitions. [2024-12-02 15:02:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 4.915254237288136) internal successors, (290), 59 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 15203 states and 19020 transitions. [2024-12-02 15:02:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 15:02:43,471 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:02:43,471 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-12-02 15:02:43,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-12-02 15:02:43,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:02:43,672 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:02:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:02:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1775421751, now seen corresponding path program 1 times [2024-12-02 15:02:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:02:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852691942] [2024-12-02 15:02:43,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:02:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:02:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:02:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 22 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:02:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:02:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852691942] [2024-12-02 15:02:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852691942] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:02:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301651032] [2024-12-02 15:02:44,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:02:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:02:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:02:44,007 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:02:44,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 15:02:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:02:44,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 15:02:44,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:02:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 26 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:02:45,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:02:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 23 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:02:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301651032] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:02:48,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:02:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 44 [2024-12-02 15:02:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523358148] [2024-12-02 15:02:48,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:02:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-12-02 15:02:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:02:48,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-12-02 15:02:48,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2024-12-02 15:02:48,621 INFO L87 Difference]: Start difference. First operand 15203 states and 19020 transitions. Second operand has 44 states, 44 states have (on average 6.545454545454546) internal successors, (288), 44 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:02:57,267 INFO L93 Difference]: Finished difference Result 39918 states and 48819 transitions. [2024-12-02 15:02:57,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-12-02 15:02:57,268 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.545454545454546) internal successors, (288), 44 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-12-02 15:02:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:02:57,289 INFO L225 Difference]: With dead ends: 39918 [2024-12-02 15:02:57,289 INFO L226 Difference]: Without dead ends: 30281 [2024-12-02 15:02:57,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2529, Invalid=10811, Unknown=0, NotChecked=0, Total=13340 [2024-12-02 15:02:57,295 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 24714 mSDsluCounter, 21326 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24714 SdHoareTripleChecker+Valid, 22899 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:02:57,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24714 Valid, 22899 Invalid, 1884 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [94 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 15:02:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30281 states. [2024-12-02 15:02:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30281 to 22750. [2024-12-02 15:02:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22750 states, 22748 states have (on average 1.237383506242307) internal successors, (28148), 22749 states have internal predecessors, (28148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22750 states to 22750 states and 28148 transitions. [2024-12-02 15:02:59,743 INFO L78 Accepts]: Start accepts. Automaton has 22750 states and 28148 transitions. Word has length 107 [2024-12-02 15:02:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:02:59,743 INFO L471 AbstractCegarLoop]: Abstraction has 22750 states and 28148 transitions. [2024-12-02 15:02:59,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.545454545454546) internal successors, (288), 44 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:02:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 22750 states and 28148 transitions. [2024-12-02 15:02:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 15:02:59,744 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:02:59,745 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-12-02 15:02:59,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 15:02:59,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:02:59,945 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:02:59,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:02:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2088015337, now seen corresponding path program 1 times [2024-12-02 15:02:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:02:59,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472415059] [2024-12-02 15:02:59,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:02:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:02:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:03:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 24 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:03:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:03:00,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472415059] [2024-12-02 15:03:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472415059] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:03:00,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019180804] [2024-12-02 15:03:00,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:03:00,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:03:00,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:03:00,452 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:03:00,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 15:03:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:03:00,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 15:03:00,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:03:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:03:01,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:03:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 41 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:03:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019180804] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:03:03,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:03:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 40 [2024-12-02 15:03:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827575514] [2024-12-02 15:03:03,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:03:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-12-02 15:03:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:03:03,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-12-02 15:03:03,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2024-12-02 15:03:03,022 INFO L87 Difference]: Start difference. First operand 22750 states and 28148 transitions. Second operand has 40 states, 40 states have (on average 7.3) internal successors, (292), 40 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:03:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:03:08,860 INFO L93 Difference]: Finished difference Result 50479 states and 61531 transitions. [2024-12-02 15:03:08,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-12-02 15:03:08,861 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.3) internal successors, (292), 40 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-12-02 15:03:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:03:08,884 INFO L225 Difference]: With dead ends: 50479 [2024-12-02 15:03:08,884 INFO L226 Difference]: Without dead ends: 35186 [2024-12-02 15:03:08,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=972, Invalid=4140, Unknown=0, NotChecked=0, Total=5112 [2024-12-02 15:03:08,892 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 22783 mSDsluCounter, 19364 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22783 SdHoareTripleChecker+Valid, 20935 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 15:03:08,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22783 Valid, 20935 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 15:03:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35186 states. [2024-12-02 15:03:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35186 to 28059. [2024-12-02 15:03:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28059 states, 28057 states have (on average 1.2257903553480416) internal successors, (34392), 28058 states have internal predecessors, (34392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:03:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28059 states to 28059 states and 34392 transitions. [2024-12-02 15:03:12,219 INFO L78 Accepts]: Start accepts. Automaton has 28059 states and 34392 transitions. Word has length 107 [2024-12-02 15:03:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:03:12,220 INFO L471 AbstractCegarLoop]: Abstraction has 28059 states and 34392 transitions. [2024-12-02 15:03:12,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.3) internal successors, (292), 40 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:03:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 28059 states and 34392 transitions. [2024-12-02 15:03:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 15:03:12,221 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:03:12,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-12-02 15:03:12,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 15:03:12,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:03:12,421 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:03:12,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:03:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 117034249, now seen corresponding path program 1 times [2024-12-02 15:03:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:03:12,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776181522] [2024-12-02 15:03:12,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:03:12,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:03:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:03:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:03:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:03:13,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776181522] [2024-12-02 15:03:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776181522] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:03:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428484395] [2024-12-02 15:03:13,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:03:13,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:03:13,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:03:13,824 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:03:13,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 15:03:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:03:13,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-12-02 15:03:13,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:03:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:03:18,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:03:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:03:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428484395] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:03:24,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:03:24,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 23] total 77 [2024-12-02 15:03:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498788530] [2024-12-02 15:03:24,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:03:24,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-12-02 15:03:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:03:24,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-12-02 15:03:24,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=5434, Unknown=0, NotChecked=0, Total=5852 [2024-12-02 15:03:24,711 INFO L87 Difference]: Start difference. First operand 28059 states and 34392 transitions. Second operand has 77 states, 77 states have (on average 3.792207792207792) internal successors, (292), 77 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:04:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:04:35,810 INFO L93 Difference]: Finished difference Result 50616 states and 61307 transitions. [2024-12-02 15:04:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2024-12-02 15:04:35,811 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.792207792207792) internal successors, (292), 77 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-12-02 15:04:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:04:35,843 INFO L225 Difference]: With dead ends: 50616 [2024-12-02 15:04:35,843 INFO L226 Difference]: Without dead ends: 33033 [2024-12-02 15:04:35,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23641 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=9158, Invalid=57664, Unknown=0, NotChecked=0, Total=66822 [2024-12-02 15:04:35,856 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 31440 mSDsluCounter, 42703 mSDsCounter, 0 mSdLazyCounter, 6218 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31440 SdHoareTripleChecker+Valid, 44341 SdHoareTripleChecker+Invalid, 6427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 6218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-12-02 15:04:35,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31440 Valid, 44341 Invalid, 6427 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [209 Valid, 6218 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-12-02 15:04:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33033 states. [2024-12-02 15:04:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33033 to 28354. [2024-12-02 15:04:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28354 states, 28352 states have (on average 1.2237937358916477) internal successors, (34697), 28353 states have internal predecessors, (34697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:04:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28354 states to 28354 states and 34697 transitions. [2024-12-02 15:04:39,652 INFO L78 Accepts]: Start accepts. Automaton has 28354 states and 34697 transitions. Word has length 107 [2024-12-02 15:04:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:04:39,652 INFO L471 AbstractCegarLoop]: Abstraction has 28354 states and 34697 transitions. [2024-12-02 15:04:39,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.792207792207792) internal successors, (292), 77 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:04:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28354 states and 34697 transitions. [2024-12-02 15:04:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-02 15:04:39,653 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:04:39,653 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-12-02 15:04:39,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-12-02 15:04:39,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:04:39,853 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:04:39,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:04:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1360080118, now seen corresponding path program 1 times [2024-12-02 15:04:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:04:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208096686] [2024-12-02 15:04:39,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:04:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:04:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:04:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 32 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:04:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:04:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208096686] [2024-12-02 15:04:40,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208096686] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:04:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099818671] [2024-12-02 15:04:40,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:04:40,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:04:40,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:04:40,916 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:04:40,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 15:04:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:04:41,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-02 15:04:41,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:04:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 32 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:04:43,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:04:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:04:51,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099818671] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:04:51,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:04:51,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 28] total 76 [2024-12-02 15:04:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724904476] [2024-12-02 15:04:51,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:04:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-12-02 15:04:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:04:51,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-12-02 15:04:51,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=5042, Unknown=0, NotChecked=0, Total=5700 [2024-12-02 15:04:51,815 INFO L87 Difference]: Start difference. First operand 28354 states and 34697 transitions. Second operand has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:05:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:05:44,142 INFO L93 Difference]: Finished difference Result 50377 states and 60989 transitions. [2024-12-02 15:05:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2024-12-02 15:05:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-12-02 15:05:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:05:44,168 INFO L225 Difference]: With dead ends: 50377 [2024-12-02 15:05:44,168 INFO L226 Difference]: Without dead ends: 33041 [2024-12-02 15:05:44,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18130 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=9606, Invalid=46326, Unknown=0, NotChecked=0, Total=55932 [2024-12-02 15:05:44,179 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 38357 mSDsluCounter, 36896 mSDsCounter, 0 mSdLazyCounter, 4258 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38357 SdHoareTripleChecker+Valid, 38453 SdHoareTripleChecker+Invalid, 4467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 4258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-12-02 15:05:44,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38357 Valid, 38453 Invalid, 4467 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [209 Valid, 4258 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-12-02 15:05:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33041 states. [2024-12-02 15:05:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33041 to 27217. [2024-12-02 15:05:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27217 states, 27215 states have (on average 1.2261987874334006) internal successors, (33371), 27216 states have internal predecessors, (33371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:05:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27217 states to 27217 states and 33371 transitions. [2024-12-02 15:05:48,029 INFO L78 Accepts]: Start accepts. Automaton has 27217 states and 33371 transitions. Word has length 108 [2024-12-02 15:05:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:05:48,029 INFO L471 AbstractCegarLoop]: Abstraction has 27217 states and 33371 transitions. [2024-12-02 15:05:48,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:05:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27217 states and 33371 transitions. [2024-12-02 15:05:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-02 15:05:48,030 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:05:48,030 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-12-02 15:05:48,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-12-02 15:05:48,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-12-02 15:05:48,230 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:05:48,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:05:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 896728914, now seen corresponding path program 1 times [2024-12-02 15:05:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:05:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388963961] [2024-12-02 15:05:48,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:05:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:05:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:05:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:05:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:05:49,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388963961] [2024-12-02 15:05:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388963961] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:05:49,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538638751] [2024-12-02 15:05:49,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:05:49,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:05:49,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:05:49,551 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:05:49,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 15:05:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:05:49,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-12-02 15:05:49,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:05:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:05:52,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:05:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 31 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:05:58,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538638751] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:05:58,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:05:58,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 26] total 75 [2024-12-02 15:05:58,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628637397] [2024-12-02 15:05:58,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:05:58,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-12-02 15:05:58,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:05:58,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-12-02 15:05:58,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=5136, Unknown=0, NotChecked=0, Total=5550 [2024-12-02 15:05:58,753 INFO L87 Difference]: Start difference. First operand 27217 states and 33371 transitions. Second operand has 75 states, 75 states have (on average 3.84) internal successors, (288), 75 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:07:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:07:12,465 INFO L93 Difference]: Finished difference Result 39147 states and 47599 transitions. [2024-12-02 15:07:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2024-12-02 15:07:12,466 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.84) internal successors, (288), 75 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-12-02 15:07:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:07:12,495 INFO L225 Difference]: With dead ends: 39147 [2024-12-02 15:07:12,495 INFO L226 Difference]: Without dead ends: 30631 [2024-12-02 15:07:12,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21772 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=9343, Invalid=57997, Unknown=0, NotChecked=0, Total=67340 [2024-12-02 15:07:12,505 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 44219 mSDsluCounter, 38653 mSDsCounter, 0 mSdLazyCounter, 3600 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44219 SdHoareTripleChecker+Valid, 40217 SdHoareTripleChecker+Invalid, 3830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 3600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-12-02 15:07:12,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44219 Valid, 40217 Invalid, 3830 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [230 Valid, 3600 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-12-02 15:07:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30631 states. [2024-12-02 15:07:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30631 to 27815. [2024-12-02 15:07:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27815 states, 27813 states have (on average 1.2241038363355266) internal successors, (34046), 27814 states have internal predecessors, (34046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:07:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27815 states to 27815 states and 34046 transitions. [2024-12-02 15:07:17,622 INFO L78 Accepts]: Start accepts. Automaton has 27815 states and 34046 transitions. Word has length 108 [2024-12-02 15:07:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:07:17,622 INFO L471 AbstractCegarLoop]: Abstraction has 27815 states and 34046 transitions. [2024-12-02 15:07:17,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.84) internal successors, (288), 75 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:07:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 27815 states and 34046 transitions. [2024-12-02 15:07:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 15:07:17,624 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:07:17,624 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:07:17,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-12-02 15:07:17,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:07:17,824 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:07:17,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:07:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1964330765, now seen corresponding path program 1 times [2024-12-02 15:07:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:07:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398786409] [2024-12-02 15:07:17,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:07:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:07:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:07:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 32 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:07:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:07:19,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398786409] [2024-12-02 15:07:19,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398786409] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:07:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915016460] [2024-12-02 15:07:19,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:07:19,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:07:19,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:07:19,598 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:07:19,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-02 15:07:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:07:19,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 15:07:19,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:07:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:07:26,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:07:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:07:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915016460] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:07:32,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:07:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2024-12-02 15:07:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312926129] [2024-12-02 15:07:32,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:07:32,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-12-02 15:07:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:07:32,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-12-02 15:07:32,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=4884, Unknown=0, NotChecked=0, Total=5256 [2024-12-02 15:07:32,024 INFO L87 Difference]: Start difference. First operand 27815 states and 34046 transitions. Second operand has 73 states, 73 states have (on average 4.232876712328767) internal successors, (309), 73 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:08:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:08:32,546 INFO L93 Difference]: Finished difference Result 48452 states and 58781 transitions. [2024-12-02 15:08:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2024-12-02 15:08:32,546 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.232876712328767) internal successors, (309), 73 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-12-02 15:08:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:08:32,566 INFO L225 Difference]: With dead ends: 48452 [2024-12-02 15:08:32,567 INFO L226 Difference]: Without dead ends: 29952 [2024-12-02 15:08:32,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11546 ImplicationChecksByTransitivity, 54.4s TimeCoverageRelationStatistics Valid=5041, Invalid=37601, Unknown=0, NotChecked=0, Total=42642 [2024-12-02 15:08:32,575 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 34869 mSDsluCounter, 43298 mSDsCounter, 0 mSdLazyCounter, 5467 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34869 SdHoareTripleChecker+Valid, 44908 SdHoareTripleChecker+Invalid, 5685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 5467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:08:32,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34869 Valid, 44908 Invalid, 5685 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [218 Valid, 5467 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-12-02 15:08:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29952 states. [2024-12-02 15:08:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29952 to 23960. [2024-12-02 15:08:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23960 states, 23958 states have (on average 1.2310710409883963) internal successors, (29494), 23959 states have internal predecessors, (29494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:08:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23960 states to 23960 states and 29494 transitions. [2024-12-02 15:08:36,517 INFO L78 Accepts]: Start accepts. Automaton has 23960 states and 29494 transitions. Word has length 109 [2024-12-02 15:08:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:08:36,517 INFO L471 AbstractCegarLoop]: Abstraction has 23960 states and 29494 transitions. [2024-12-02 15:08:36,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.232876712328767) internal successors, (309), 73 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:08:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 23960 states and 29494 transitions. [2024-12-02 15:08:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-02 15:08:36,518 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:08:36,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-12-02 15:08:36,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-12-02 15:08:36,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-12-02 15:08:36,719 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:08:36,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:08:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash -679259444, now seen corresponding path program 1 times [2024-12-02 15:08:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:08:36,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123819435] [2024-12-02 15:08:36,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:08:36,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:08:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:08:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:08:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:08:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123819435] [2024-12-02 15:08:36,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123819435] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:08:36,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:08:36,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:08:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569988990] [2024-12-02 15:08:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:08:36,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:08:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:08:36,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:08:36,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:08:36,836 INFO L87 Difference]: Start difference. First operand 23960 states and 29494 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:08:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:08:45,052 INFO L93 Difference]: Finished difference Result 27003 states and 35142 transitions. [2024-12-02 15:08:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:08:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-12-02 15:08:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:08:45,076 INFO L225 Difference]: With dead ends: 27003 [2024-12-02 15:08:45,077 INFO L226 Difference]: Without dead ends: 25462 [2024-12-02 15:08:45,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:08:45,082 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 757 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:08:45,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 852 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-12-02 15:08:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25462 states. [2024-12-02 15:08:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25462 to 25462. [2024-12-02 15:08:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25462 states, 25460 states have (on average 1.2204241948153967) internal successors, (31072), 25461 states have internal predecessors, (31072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:08:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25462 states to 25462 states and 31072 transitions. [2024-12-02 15:08:48,996 INFO L78 Accepts]: Start accepts. Automaton has 25462 states and 31072 transitions. Word has length 131 [2024-12-02 15:08:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:08:48,996 INFO L471 AbstractCegarLoop]: Abstraction has 25462 states and 31072 transitions. [2024-12-02 15:08:48,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:08:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 25462 states and 31072 transitions. [2024-12-02 15:08:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 15:08:48,998 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:08:48,998 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 15:08:48,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 15:08:48,999 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:08:48,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:08:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 289672907, now seen corresponding path program 1 times [2024-12-02 15:08:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:08:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725094831] [2024-12-02 15:08:48,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:08:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:08:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:08:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 37 proven. 190 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 15:08:49,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:08:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725094831] [2024-12-02 15:08:49,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725094831] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:08:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157339957] [2024-12-02 15:08:49,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:08:49,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:08:49,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:08:49,466 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:08:49,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-02 15:08:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:08:49,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-12-02 15:08:49,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:08:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 37 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:08:52,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:08:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 37 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:08:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157339957] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:08:59,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:08:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28, 27] total 59 [2024-12-02 15:08:59,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013905284] [2024-12-02 15:08:59,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:08:59,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-02 15:08:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:08:59,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-02 15:08:59,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2024-12-02 15:08:59,030 INFO L87 Difference]: Start difference. First operand 25462 states and 31072 transitions. Second operand has 60 states, 60 states have (on average 6.05) internal successors, (363), 59 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:09:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:09:08,500 INFO L93 Difference]: Finished difference Result 43147 states and 52650 transitions. [2024-12-02 15:09:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-12-02 15:09:08,500 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 6.05) internal successors, (363), 59 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-12-02 15:09:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:09:08,522 INFO L225 Difference]: With dead ends: 43147 [2024-12-02 15:09:08,522 INFO L226 Difference]: Without dead ends: 32790 [2024-12-02 15:09:08,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2440, Invalid=9992, Unknown=0, NotChecked=0, Total=12432 [2024-12-02 15:09:08,528 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 16228 mSDsluCounter, 26964 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16228 SdHoareTripleChecker+Valid, 28455 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:09:08,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16228 Valid, 28455 Invalid, 2214 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 15:09:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32790 states. [2024-12-02 15:09:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32790 to 20493. [2024-12-02 15:09:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20493 states, 20491 states have (on average 1.2168757015274998) internal successors, (24935), 20492 states have internal predecessors, (24935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:09:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20493 states to 20493 states and 24935 transitions. [2024-12-02 15:09:12,204 INFO L78 Accepts]: Start accepts. Automaton has 20493 states and 24935 transitions. Word has length 146 [2024-12-02 15:09:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:09:12,205 INFO L471 AbstractCegarLoop]: Abstraction has 20493 states and 24935 transitions. [2024-12-02 15:09:12,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 6.05) internal successors, (363), 59 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:09:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20493 states and 24935 transitions. [2024-12-02 15:09:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 15:09:12,207 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:09:12,207 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:09:12,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-12-02 15:09:12,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:09:12,408 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:09:12,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:09:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 283574013, now seen corresponding path program 1 times [2024-12-02 15:09:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:09:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338467658] [2024-12-02 15:09:12,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:09:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:09:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:09:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 55 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:09:13,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:09:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338467658] [2024-12-02 15:09:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338467658] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:09:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599521428] [2024-12-02 15:09:13,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:09:13,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:09:13,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:09:13,166 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:09:13,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-02 15:09:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:09:13,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-02 15:09:13,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:09:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 50 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:09:15,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:09:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 44 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:09:20,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599521428] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:09:20,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:09:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 20] total 60 [2024-12-02 15:09:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564316000] [2024-12-02 15:09:20,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:09:20,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-02 15:09:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:09:20,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-02 15:09:20,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3223, Unknown=0, NotChecked=0, Total=3540 [2024-12-02 15:09:20,882 INFO L87 Difference]: Start difference. First operand 20493 states and 24935 transitions. Second operand has 60 states, 60 states have (on average 6.833333333333333) internal successors, (410), 60 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:09:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:09:46,189 INFO L93 Difference]: Finished difference Result 48727 states and 58431 transitions. [2024-12-02 15:09:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-12-02 15:09:46,190 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 6.833333333333333) internal successors, (410), 60 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-12-02 15:09:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:09:46,213 INFO L225 Difference]: With dead ends: 48727 [2024-12-02 15:09:46,213 INFO L226 Difference]: Without dead ends: 35658 [2024-12-02 15:09:46,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8251 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=4683, Invalid=25419, Unknown=0, NotChecked=0, Total=30102 [2024-12-02 15:09:46,221 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 28827 mSDsluCounter, 35222 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28827 SdHoareTripleChecker+Valid, 36703 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:09:46,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28827 Valid, 36703 Invalid, 2684 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [192 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 15:09:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35658 states. [2024-12-02 15:09:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35658 to 29484. [2024-12-02 15:09:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29484 states, 29482 states have (on average 1.2006987314293467) internal successors, (35399), 29483 states have internal predecessors, (35399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:09:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29484 states to 29484 states and 35399 transitions. [2024-12-02 15:09:52,608 INFO L78 Accepts]: Start accepts. Automaton has 29484 states and 35399 transitions. Word has length 146 [2024-12-02 15:09:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:09:52,608 INFO L471 AbstractCegarLoop]: Abstraction has 29484 states and 35399 transitions. [2024-12-02 15:09:52,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 6.833333333333333) internal successors, (410), 60 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:09:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29484 states and 35399 transitions. [2024-12-02 15:09:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-02 15:09:52,610 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:09:52,610 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-02 15:09:52,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-12-02 15:09:52,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 15:09:52,811 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:09:52,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:09:52,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1346272192, now seen corresponding path program 1 times [2024-12-02 15:09:52,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:09:52,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126584440] [2024-12-02 15:09:52,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:09:52,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:09:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:09:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 145 proven. 73 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-02 15:09:54,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:09:54,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126584440] [2024-12-02 15:09:54,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126584440] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:09:54,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75377123] [2024-12-02 15:09:54,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:09:54,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:09:54,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:09:54,074 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:09:54,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-12-02 15:09:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:09:54,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 15:09:54,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:09:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 37 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:09:56,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:09:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 37 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:09:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75377123] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:09:59,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:09:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 18] total 60 [2024-12-02 15:09:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198661973] [2024-12-02 15:09:59,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:09:59,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-12-02 15:09:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:09:59,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-12-02 15:09:59,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=3312, Unknown=0, NotChecked=0, Total=3540 [2024-12-02 15:09:59,957 INFO L87 Difference]: Start difference. First operand 29484 states and 35399 transitions. Second operand has 60 states, 60 states have (on average 6.733333333333333) internal successors, (404), 60 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:10:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:10:39,893 INFO L93 Difference]: Finished difference Result 46473 states and 55419 transitions. [2024-12-02 15:10:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2024-12-02 15:10:39,893 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 6.733333333333333) internal successors, (404), 60 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-12-02 15:10:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:10:39,915 INFO L225 Difference]: With dead ends: 46473 [2024-12-02 15:10:39,915 INFO L226 Difference]: Without dead ends: 29249 [2024-12-02 15:10:39,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16408 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=8009, Invalid=45583, Unknown=0, NotChecked=0, Total=53592 [2024-12-02 15:10:39,924 INFO L435 NwaCegarLoop]: 1647 mSDtfsCounter, 31182 mSDsluCounter, 45582 mSDsCounter, 0 mSdLazyCounter, 7151 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31182 SdHoareTripleChecker+Valid, 47229 SdHoareTripleChecker+Invalid, 7296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 7151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:10:39,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31182 Valid, 47229 Invalid, 7296 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [145 Valid, 7151 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-12-02 15:10:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29249 states. [2024-12-02 15:10:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29249 to 25040. [2024-12-02 15:10:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25040 states, 25038 states have (on average 1.204688872913172) internal successors, (30163), 25039 states have internal predecessors, (30163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:10:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25040 states to 25040 states and 30163 transitions. [2024-12-02 15:10:44,742 INFO L78 Accepts]: Start accepts. Automaton has 25040 states and 30163 transitions. Word has length 147 [2024-12-02 15:10:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:10:44,742 INFO L471 AbstractCegarLoop]: Abstraction has 25040 states and 30163 transitions. [2024-12-02 15:10:44,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 6.733333333333333) internal successors, (404), 60 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:10:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 25040 states and 30163 transitions. [2024-12-02 15:10:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-02 15:10:44,743 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:10:44,744 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 15:10:44,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-12-02 15:10:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-12-02 15:10:44,944 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:10:44,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:10:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash -970975155, now seen corresponding path program 1 times [2024-12-02 15:10:44,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:10:44,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517463663] [2024-12-02 15:10:44,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:10:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:10:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:10:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 20 proven. 199 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-02 15:10:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:10:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517463663] [2024-12-02 15:10:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517463663] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:10:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405904967] [2024-12-02 15:10:45,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:10:45,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:10:45,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:10:45,065 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:10:45,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-12-02 15:10:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:10:45,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 15:10:45,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:10:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 20 proven. 199 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-02 15:10:45,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:10:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-02 15:10:45,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405904967] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:10:45,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:10:45,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 17 [2024-12-02 15:10:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266947919] [2024-12-02 15:10:45,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:10:45,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 15:10:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:10:45,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 15:10:45,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-12-02 15:10:45,885 INFO L87 Difference]: Start difference. First operand 25040 states and 30163 transitions. Second operand has 17 states, 17 states have (on average 16.647058823529413) internal successors, (283), 17 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:10:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:10:50,147 INFO L93 Difference]: Finished difference Result 50037 states and 61279 transitions. [2024-12-02 15:10:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 15:10:50,147 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.647058823529413) internal successors, (283), 17 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-12-02 15:10:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:10:50,168 INFO L225 Difference]: With dead ends: 50037 [2024-12-02 15:10:50,168 INFO L226 Difference]: Without dead ends: 29495 [2024-12-02 15:10:50,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-12-02 15:10:50,176 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 4385 mSDsluCounter, 7942 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4385 SdHoareTripleChecker+Valid, 9472 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:10:50,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4385 Valid, 9472 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 15:10:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29495 states. [2024-12-02 15:10:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29495 to 29491. [2024-12-02 15:10:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29491 states, 29489 states have (on average 1.1802027874800773) internal successors, (34803), 29490 states have internal predecessors, (34803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:10:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29491 states to 29491 states and 34803 transitions. [2024-12-02 15:10:54,471 INFO L78 Accepts]: Start accepts. Automaton has 29491 states and 34803 transitions. Word has length 148 [2024-12-02 15:10:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:10:54,471 INFO L471 AbstractCegarLoop]: Abstraction has 29491 states and 34803 transitions. [2024-12-02 15:10:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.647058823529413) internal successors, (283), 17 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:10:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 29491 states and 34803 transitions. [2024-12-02 15:10:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-02 15:10:54,473 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:10:54,473 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:10:54,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-12-02 15:10:54,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:10:54,673 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:10:54,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:10:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash -352711843, now seen corresponding path program 1 times [2024-12-02 15:10:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:10:54,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421038374] [2024-12-02 15:10:54,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:10:54,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:10:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:10:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 53 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:10:55,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:10:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421038374] [2024-12-02 15:10:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421038374] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:10:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496307353] [2024-12-02 15:10:55,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:10:55,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:10:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:10:55,880 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:10:55,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-12-02 15:10:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:10:56,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-02 15:10:56,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:10:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 53 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:10:58,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:11:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 53 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:11:01,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496307353] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:11:01,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 15:11:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 19] total 62 [2024-12-02 15:11:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143819924] [2024-12-02 15:11:01,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 15:11:01,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-12-02 15:11:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:11:01,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-12-02 15:11:01,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3490, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 15:11:01,743 INFO L87 Difference]: Start difference. First operand 29491 states and 34803 transitions. Second operand has 62 states, 62 states have (on average 6.290322580645161) internal successors, (390), 62 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:11:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:11:57,167 INFO L93 Difference]: Finished difference Result 49300 states and 57758 transitions. [2024-12-02 15:11:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2024-12-02 15:11:57,167 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 6.290322580645161) internal successors, (390), 62 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-12-02 15:11:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:11:57,190 INFO L225 Difference]: With dead ends: 49300 [2024-12-02 15:11:57,190 INFO L226 Difference]: Without dead ends: 28395 [2024-12-02 15:11:57,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25932 ImplicationChecksByTransitivity, 48.8s TimeCoverageRelationStatistics Valid=12437, Invalid=59655, Unknown=0, NotChecked=0, Total=72092 [2024-12-02 15:11:57,200 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 41897 mSDsluCounter, 26429 mSDsCounter, 0 mSdLazyCounter, 4055 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41897 SdHoareTripleChecker+Valid, 27955 SdHoareTripleChecker+Invalid, 4215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 4055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:11:57,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41897 Valid, 27955 Invalid, 4215 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [160 Valid, 4055 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-12-02 15:11:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28395 states. [2024-12-02 15:11:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28395 to 19203. [2024-12-02 15:11:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19203 states, 19201 states have (on average 1.1901463465444508) internal successors, (22852), 19202 states have internal predecessors, (22852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:11:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19203 states to 19203 states and 22852 transitions. [2024-12-02 15:11:59,979 INFO L78 Accepts]: Start accepts. Automaton has 19203 states and 22852 transitions. Word has length 148 [2024-12-02 15:11:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:11:59,979 INFO L471 AbstractCegarLoop]: Abstraction has 19203 states and 22852 transitions. [2024-12-02 15:11:59,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 6.290322580645161) internal successors, (390), 62 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:11:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 19203 states and 22852 transitions. [2024-12-02 15:11:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-02 15:11:59,981 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:11:59,981 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:11:59,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-12-02 15:12:00,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:00,181 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:12:00,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 666783477, now seen corresponding path program 1 times [2024-12-02 15:12:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:00,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899508810] [2024-12-02 15:12:00,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:12:00,211 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 15:12:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:12:00,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 15:12:00,275 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 15:12:00,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-12-02 15:12:00,277 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-02 15:12:00,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 15:12:00,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:00,413 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 15:12:00,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:12:00 BoogieIcfgContainer [2024-12-02 15:12:00,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 15:12:00,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 15:12:00,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 15:12:00,417 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 15:12:00,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:45" (3/4) ... [2024-12-02 15:12:00,419 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 15:12:00,590 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 154. [2024-12-02 15:12:00,703 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 15:12:00,704 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 15:12:00,704 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 15:12:00,705 INFO L158 Benchmark]: Toolchain (without parser) took 801399.58ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 105.0MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 895.8MB. Max. memory is 16.1GB. [2024-12-02 15:12:00,705 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:12:00,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1497.98ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 49.3MB in the end (delta: 55.6MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-12-02 15:12:00,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 255.56ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 48.6MB in the beginning and 299.2MB in the end (delta: -250.7MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2024-12-02 15:12:00,706 INFO L158 Benchmark]: Boogie Preprocessor took 400.45ms. Allocated memory is still 402.7MB. Free memory was 299.2MB in the beginning and 280.7MB in the end (delta: 18.5MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2024-12-02 15:12:00,706 INFO L158 Benchmark]: RCFGBuilder took 4530.87ms. Allocated memory was 402.7MB in the beginning and 805.3MB in the end (delta: 402.7MB). Free memory was 280.7MB in the beginning and 424.0MB in the end (delta: -143.3MB). Peak memory consumption was 260.8MB. Max. memory is 16.1GB. [2024-12-02 15:12:00,706 INFO L158 Benchmark]: TraceAbstraction took 794421.15ms. Allocated memory was 805.3MB in the beginning and 3.6GB in the end (delta: 2.8GB). Free memory was 424.0MB in the beginning and 2.7GB in the end (delta: -2.2GB). Peak memory consumption was 514.9MB. Max. memory is 16.1GB. [2024-12-02 15:12:00,706 INFO L158 Benchmark]: Witness Printer took 287.29ms. Allocated memory is still 3.6GB. Free memory was 2.7GB in the beginning and 2.6GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 15:12:00,707 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.36ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1497.98ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 49.3MB in the end (delta: 55.6MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 255.56ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 48.6MB in the beginning and 299.2MB in the end (delta: -250.7MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 400.45ms. Allocated memory is still 402.7MB. Free memory was 299.2MB in the beginning and 280.7MB in the end (delta: 18.5MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4530.87ms. Allocated memory was 402.7MB in the beginning and 805.3MB in the end (delta: 402.7MB). Free memory was 280.7MB in the beginning and 424.0MB in the end (delta: -143.3MB). Peak memory consumption was 260.8MB. Max. memory is 16.1GB. * TraceAbstraction took 794421.15ms. Allocated memory was 805.3MB in the beginning and 3.6GB in the end (delta: 2.8GB). Free memory was 424.0MB in the beginning and 2.7GB in the end (delta: -2.2GB). Peak memory consumption was 514.9MB. Max. memory is 16.1GB. * Witness Printer took 287.29ms. Allocated memory is still 3.6GB. Free memory was 2.7GB in the beginning and 2.6GB in the end (delta: 33.6MB). 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: 297]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] msg_t nomsg = (msg_t )-1; [L39] unsigned char r1 ; [L40] port_t p1 ; [L41] char p1_old ; [L42] char p1_new ; [L43] char id1 ; [L44] char st1 ; [L45] msg_t send1 ; [L46] _Bool mode1 ; [L47] port_t p2 ; [L48] char p2_old ; [L49] char p2_new ; [L50] char id2 ; [L51] char st2 ; [L52] msg_t send2 ; [L53] _Bool mode2 ; [L54] port_t p3 ; [L55] char p3_old ; [L56] char p3_new ; [L57] char id3 ; [L58] char st3 ; [L59] msg_t send3 ; [L60] _Bool mode3 ; [L313] int inputC = 3; [L314] int inputF = 6; [L315] int inputA = 1; [L316] int inputB = 2; [L317] int inputD = 4; [L318] int inputE = 5; [L321] int a17 = -124; [L322] int a5 = 4; [L323] int a24 = 15; [L324] int a2 = 170; [L325] int a7 = 13; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=0, id2=0, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L5133] COND TRUE __VERIFIER_nondet_int() [L5134] CALL main1() [L245] int c1 ; [L246] int i2 ; [L249] c1 = 0 [L250] r1 = __VERIFIER_nondet_uchar() [L251] id1 = __VERIFIER_nondet_char() [L252] st1 = __VERIFIER_nondet_char() [L253] send1 = __VERIFIER_nondet_char() [L254] mode1 = __VERIFIER_nondet_bool() [L255] id2 = __VERIFIER_nondet_char() [L256] st2 = __VERIFIER_nondet_char() [L257] send2 = __VERIFIER_nondet_char() [L258] mode2 = __VERIFIER_nondet_bool() [L259] id3 = __VERIFIER_nondet_char() [L260] st3 = __VERIFIER_nondet_char() [L261] send3 = __VERIFIER_nondet_char() [L262] mode3 = __VERIFIER_nondet_bool() [L263] CALL, EXPR init() [L144] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L147] COND TRUE (int )r1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L148] COND TRUE (int )id1 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L149] COND TRUE (int )st1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L150] COND TRUE (int )send1 == (int )id1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L151] COND TRUE (int )mode1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L152] COND TRUE (int )id2 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L153] COND TRUE (int )st2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L154] COND TRUE (int )send2 == (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L155] COND TRUE (int )mode2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L156] COND TRUE (int )id3 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L157] COND TRUE (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L158] COND TRUE (int )send3 == (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L159] COND TRUE (int )mode3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L160] COND TRUE (int )id1 != (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L161] COND TRUE (int )id1 != (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L162] COND TRUE (int )id2 != (int )id3 [L163] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0, tmp=1] [L212] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L263] RET, EXPR init() [L263] i2 = init() [L264] CALL assume_abort_if_not(i2) [L32] COND FALSE !(!cond) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L264] RET assume_abort_if_not(i2) [L265] p1_old = nomsg [L266] p1_new = nomsg [L267] p2_old = nomsg [L268] p2_new = nomsg [L269] p3_old = nomsg [L270] p3_new = nomsg [L271] i2 = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=5, p1_old=-1, p2=0, p2_new=4, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=0, r1=0, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=5, send2=4, send3=0, st1=0, st2=0, st3=0] [L78] COND FALSE !((int )m1 == (int )id1) [L81] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=5, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=5, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=5, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=4, send3=0, st1=0, st2=0, st3=0] [L102] COND TRUE (int )m2 > (int )id2 [L103] send2 = m2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=4, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=4, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=4, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=0, st1=0, st2=0, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=4, p3_old=-1, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=4, r1=1, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=4, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=5, send3=4, st1=0, st2=0, st3=0] [L78] COND FALSE !((int )m1 == (int )id1) [L81] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L102] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L105] COND FALSE !((int )m2 == (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=5, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=5, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=4, st1=0, st2=0, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=4, p1_old=-1, p2=0, p2_new=5, p2_old=-1, p3=0, p3_new=5, p3_old=-1, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); VAL [\result=1, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=5, r1=2, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=5, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=0, st2=0, st3=0] [L78] COND TRUE (int )m1 == (int )id1 [L79] st1 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=4, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L102] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=4, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=0, st3=0] [L105] COND TRUE (int )m2 == (int )id2 [L106] st2 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=5, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=5, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=5, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L220] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L238] tmp = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0, tmp=0] [L240] return (tmp); VAL [\result=0, a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND TRUE ! arg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] [L297] reach_error() VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=5, id2=4, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=4, send2=5, send3=5, st1=1, st2=1, st3=0] - UnprovableResult [Line: 492]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 874 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 794.2s, OverallIterations: 43, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 574.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 620461 SdHoareTripleChecker+Valid, 60.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 620461 mSDsluCounter, 691872 SdHoareTripleChecker+Invalid, 53.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 628576 mSDsCounter, 4499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71292 IncrementalHoareTripleChecker+Invalid, 75791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4499 mSolverCounterUnsat, 63296 mSDtfsCounter, 71292 mSolverCounterSat, 2.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7817 GetRequests, 4394 SyntacticMatches, 10 SemanticMatches, 3413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195732 ImplicationChecksByTransitivity, 488.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29491occurred in iteration=41, InterpolantAutomatonStates: 2380, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.9s AutomataMinimizationTime, 42 MinimizatonAttempts, 109045 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 152.9s InterpolantComputationTime, 6081 NumberOfCodeBlocks, 6081 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 8391 ConstructedInterpolants, 10 QuantifiedInterpolants, 196144 SizeOfPredicates, 180 NumberOfNonLiveVariables, 10480 ConjunctsInSsa, 806 ConjunctsInUnsatCore, 92 InterpolantComputations, 17 PerfectInterpolantSequences, 2451/7697 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-12-02 15:12:00,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34a088e-48ba-4a21-8758-bdcb494472f6/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE