./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.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_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/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_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/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_343235cd-3e8f-415f-859e-17c37a5d1da6/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 d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:33:43,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:33:43,711 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 11:33:43,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:33:43,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:33:43,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:33:43,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:33:43,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:33:43,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:33:43,734 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:33:43,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:33:43,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:33:43,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:33:43,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:33:43,735 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:33:43,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:33:43,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:33:43,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:33:43,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:33:43,736 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:33:43,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:33:43,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:33:43,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:33:43,737 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:33:43,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:33:43,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:33:43,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:33:43,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:33:43,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:33:43,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:33:43,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:33:43,738 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_343235cd-3e8f-415f-859e-17c37a5d1da6/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 -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2024-12-02 11:33:43,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:33:43,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:33:43,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:33:43,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:33:43,937 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:33:43,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-12-02 11:33:46,556 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/data/1963384fe/8a7adfbf20c14d939181cb8b4da44c65/FLAGdf4bd2008 [2024-12-02 11:33:46,754 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:33:46,754 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-12-02 11:33:46,761 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/data/1963384fe/8a7adfbf20c14d939181cb8b4da44c65/FLAGdf4bd2008 [2024-12-02 11:33:47,106 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/data/1963384fe/8a7adfbf20c14d939181cb8b4da44c65 [2024-12-02 11:33:47,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:33:47,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:33:47,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:33:47,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:33:47,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:33:47,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117e6a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47, skipping insertion in model container [2024-12-02 11:33:47,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:33:47,264 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_343235cd-3e8f-415f-859e-17c37a5d1da6/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2024-12-02 11:33:47,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:33:47,276 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:33:47,305 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_343235cd-3e8f-415f-859e-17c37a5d1da6/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2024-12-02 11:33:47,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:33:47,318 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:33:47,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47 WrapperNode [2024-12-02 11:33:47,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:33:47,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:33:47,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:33:47,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:33:47,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,347 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-12-02 11:33:47,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:33:47,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:33:47,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:33:47,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:33:47,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,370 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 11:33:47,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:33:47,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:33:47,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:33:47,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:33:47,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (1/1) ... [2024-12-02 11:33:47,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:33:47,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:33:47,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:33:47,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:33:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:33:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 11:33:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:33:47,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:33:47,509 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:33:47,511 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:33:47,774 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-12-02 11:33:47,774 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:33:47,784 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:33:47,785 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 11:33:47,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:33:47 BoogieIcfgContainer [2024-12-02 11:33:47,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:33:47,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:33:47,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:33:47,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:33:47,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:33:47" (1/3) ... [2024-12-02 11:33:47,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3affd181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:33:47, skipping insertion in model container [2024-12-02 11:33:47,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:33:47" (2/3) ... [2024-12-02 11:33:47,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3affd181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:33:47, skipping insertion in model container [2024-12-02 11:33:47,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:33:47" (3/3) ... [2024-12-02 11:33:47,794 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-12-02 11:33:47,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:33:47,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c that has 1 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 11:33:47,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:33:47,872 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;@46f7ed26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:33:47,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 11:33:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 55 states have (on average 1.690909090909091) internal successors, (93), 56 states have internal predecessors, (93), 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 11:33:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 11:33:47,882 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:47,882 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 11:33:47,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:47,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:47,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1016771987, now seen corresponding path program 1 times [2024-12-02 11:33:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:47,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018662815] [2024-12-02 11:33:47,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:48,077 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 11:33:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018662815] [2024-12-02 11:33:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018662815] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:48,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:48,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:33:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039494341] [2024-12-02 11:33:48,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:48,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 11:33:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:48,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 11:33:48,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 11:33:48,110 INFO L87 Difference]: Start difference. First operand has 57 states, 55 states have (on average 1.690909090909091) internal successors, (93), 56 states have internal predecessors, (93), 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 11:33:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:48,124 INFO L93 Difference]: Finished difference Result 93 states and 148 transitions. [2024-12-02 11:33:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 11:33:48,125 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 11:33:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:48,131 INFO L225 Difference]: With dead ends: 93 [2024-12-02 11:33:48,131 INFO L226 Difference]: Without dead ends: 53 [2024-12-02 11:33:48,133 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 11:33:48,136 INFO L435 NwaCegarLoop]: 90 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, 90 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 11:33:48,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-12-02 11:33:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-12-02 11:33:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 52 states have internal predecessors, (86), 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 11:33:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2024-12-02 11:33:48,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 86 transitions. Word has length 20 [2024-12-02 11:33:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:48,159 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 86 transitions. [2024-12-02 11:33:48,160 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 11:33:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2024-12-02 11:33:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 11:33:48,160 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:48,161 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 11:33:48,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:33:48,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:48,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -263091691, now seen corresponding path program 1 times [2024-12-02 11:33:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:48,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264848371] [2024-12-02 11:33:48,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:48,327 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 11:33:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264848371] [2024-12-02 11:33:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264848371] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:48,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:33:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87650536] [2024-12-02 11:33:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:48,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:33:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:48,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:33:48,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:33:48,330 INFO L87 Difference]: Start difference. First operand 53 states and 86 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 11:33:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:48,406 INFO L93 Difference]: Finished difference Result 119 states and 186 transitions. [2024-12-02 11:33:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:33:48,407 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 11:33:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:48,408 INFO L225 Difference]: With dead ends: 119 [2024-12-02 11:33:48,408 INFO L226 Difference]: Without dead ends: 84 [2024-12-02 11:33:48,409 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 11:33:48,410 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 47 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:33:48,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 306 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:33:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-12-02 11:33:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2024-12-02 11:33:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 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 11:33:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2024-12-02 11:33:48,416 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 20 [2024-12-02 11:33:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:48,416 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2024-12-02 11:33:48,416 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 11:33:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2024-12-02 11:33:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-02 11:33:48,417 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:48,417 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 11:33:48,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:33:48,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:48,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash -668548648, now seen corresponding path program 1 times [2024-12-02 11:33:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:48,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162309117] [2024-12-02 11:33:48,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:48,557 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 11:33:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162309117] [2024-12-02 11:33:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162309117] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:48,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:48,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:33:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982359203] [2024-12-02 11:33:48,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:48,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:33:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:48,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:33:48,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:33:48,559 INFO L87 Difference]: Start difference. First operand 53 states and 70 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 11:33:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:48,696 INFO L93 Difference]: Finished difference Result 239 states and 358 transitions. [2024-12-02 11:33:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:33:48,697 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 11:33:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:48,698 INFO L225 Difference]: With dead ends: 239 [2024-12-02 11:33:48,698 INFO L226 Difference]: Without dead ends: 208 [2024-12-02 11:33:48,699 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 11:33:48,700 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 276 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:33:48,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 436 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:33:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-12-02 11:33:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 82. [2024-12-02 11:33:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 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 11:33:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2024-12-02 11:33:48,711 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 35 [2024-12-02 11:33:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:48,711 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2024-12-02 11:33:48,711 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 11:33:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2024-12-02 11:33:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 11:33:48,713 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:48,713 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 11:33:48,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:33:48,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:48,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash 354142280, now seen corresponding path program 1 times [2024-12-02 11:33:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:48,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782936162] [2024-12-02 11:33:48,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:48,803 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 11:33:48,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:48,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782936162] [2024-12-02 11:33:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782936162] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:48,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:33:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209935854] [2024-12-02 11:33:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:48,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:33:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:48,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:33:48,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:33:48,805 INFO L87 Difference]: Start difference. First operand 82 states and 115 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 11:33:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:48,824 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2024-12-02 11:33:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:33:48,825 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 11:33:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:48,826 INFO L225 Difference]: With dead ends: 191 [2024-12-02 11:33:48,826 INFO L226 Difference]: Without dead ends: 131 [2024-12-02 11:33:48,827 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 11:33:48,827 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 27 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:33:48,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 111 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-12-02 11:33:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-12-02 11:33:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4453125) internal successors, (185), 128 states have internal predecessors, (185), 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 11:33:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 185 transitions. [2024-12-02 11:33:48,837 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 185 transitions. Word has length 37 [2024-12-02 11:33:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:48,838 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 185 transitions. [2024-12-02 11:33:48,838 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 11:33:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 185 transitions. [2024-12-02 11:33:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 11:33:48,839 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:48,839 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 11:33:48,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:33:48,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash 420635792, now seen corresponding path program 1 times [2024-12-02 11:33:48,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:48,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352335743] [2024-12-02 11:33:48,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:49,002 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 11:33:49,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:49,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352335743] [2024-12-02 11:33:49,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352335743] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:49,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:49,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:33:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253413106] [2024-12-02 11:33:49,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:49,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:33:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:49,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:33:49,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:33:49,004 INFO L87 Difference]: Start difference. First operand 129 states and 185 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 11:33:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:49,074 INFO L93 Difference]: Finished difference Result 238 states and 349 transitions. [2024-12-02 11:33:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:33:49,075 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 11:33:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:49,076 INFO L225 Difference]: With dead ends: 238 [2024-12-02 11:33:49,076 INFO L226 Difference]: Without dead ends: 131 [2024-12-02 11:33:49,076 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 11:33:49,077 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 197 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 11:33:49,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 197 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-12-02 11:33:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-12-02 11:33:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4296875) internal successors, (183), 128 states have internal predecessors, (183), 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 11:33:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2024-12-02 11:33:49,086 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 37 [2024-12-02 11:33:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:49,086 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2024-12-02 11:33:49,086 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 11:33:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2024-12-02 11:33:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 11:33:49,087 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:49,087 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 11:33:49,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:33:49,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:49,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash -259915559, now seen corresponding path program 1 times [2024-12-02 11:33:49,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:49,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277718472] [2024-12-02 11:33:49,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:49,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:49,310 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 11:33:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:49,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277718472] [2024-12-02 11:33:49,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277718472] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:49,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:49,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:33:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136382471] [2024-12-02 11:33:49,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:49,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:33:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:49,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:33:49,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:33:49,312 INFO L87 Difference]: Start difference. First operand 129 states and 183 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 11:33:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:49,358 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2024-12-02 11:33:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:33:49,359 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 11:33:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:49,360 INFO L225 Difference]: With dead ends: 137 [2024-12-02 11:33:49,360 INFO L226 Difference]: Without dead ends: 135 [2024-12-02 11:33:49,360 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 11:33:49,361 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:33:49,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-12-02 11:33:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-12-02 11:33:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.4029850746268657) internal successors, (188), 134 states have internal predecessors, (188), 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 11:33:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 188 transitions. [2024-12-02 11:33:49,368 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 188 transitions. Word has length 38 [2024-12-02 11:33:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:49,369 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 188 transitions. [2024-12-02 11:33:49,369 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 11:33:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 188 transitions. [2024-12-02 11:33:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 11:33:49,370 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:49,370 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 11:33:49,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:33:49,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:49,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1886850160, now seen corresponding path program 1 times [2024-12-02 11:33:49,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:49,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222619263] [2024-12-02 11:33:49,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:49,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:49,419 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 11:33:49,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:49,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222619263] [2024-12-02 11:33:49,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222619263] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:49,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:49,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:33:49,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989471107] [2024-12-02 11:33:49,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:49,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:33:49,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:49,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:33:49,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:33:49,420 INFO L87 Difference]: Start difference. First operand 135 states and 188 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 11:33:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:49,437 INFO L93 Difference]: Finished difference Result 262 states and 374 transitions. [2024-12-02 11:33:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:33:49,437 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 11:33:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:49,438 INFO L225 Difference]: With dead ends: 262 [2024-12-02 11:33:49,438 INFO L226 Difference]: Without dead ends: 196 [2024-12-02 11:33:49,439 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 11:33:49,439 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 37 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 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 11:33:49,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-12-02 11:33:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2024-12-02 11:33:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 193 states have internal predecessors, (272), 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 11:33:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2024-12-02 11:33:49,449 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 39 [2024-12-02 11:33:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:49,450 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2024-12-02 11:33:49,450 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 11:33:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2024-12-02 11:33:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 11:33:49,451 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:49,451 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 11:33:49,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:33:49,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:49,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:49,451 INFO L85 PathProgramCache]: Analyzing trace with hash 192648336, now seen corresponding path program 1 times [2024-12-02 11:33:49,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:49,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63174288] [2024-12-02 11:33:49,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:49,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:49,499 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 11:33:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:49,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63174288] [2024-12-02 11:33:49,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63174288] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:49,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:49,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:33:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435360874] [2024-12-02 11:33:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:49,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:33:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:49,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:33:49,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:33:49,501 INFO L87 Difference]: Start difference. First operand 194 states and 272 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 11:33:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:49,519 INFO L93 Difference]: Finished difference Result 508 states and 724 transitions. [2024-12-02 11:33:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:33:49,519 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 11:33:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:49,521 INFO L225 Difference]: With dead ends: 508 [2024-12-02 11:33:49,521 INFO L226 Difference]: Without dead ends: 339 [2024-12-02 11:33:49,521 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 11:33:49,522 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 157 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 11:33:49,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-12-02 11:33:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2024-12-02 11:33:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.3988095238095237) internal successors, (470), 336 states have internal predecessors, (470), 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 11:33:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 470 transitions. [2024-12-02 11:33:49,534 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 470 transitions. Word has length 39 [2024-12-02 11:33:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:49,534 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 470 transitions. [2024-12-02 11:33:49,535 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 11:33:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 470 transitions. [2024-12-02 11:33:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 11:33:49,535 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:49,535 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 11:33:49,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:33:49,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:49,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1973581200, now seen corresponding path program 1 times [2024-12-02 11:33:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:49,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378248331] [2024-12-02 11:33:49,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:49,571 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 11:33:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378248331] [2024-12-02 11:33:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378248331] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:49,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:49,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:33:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975147291] [2024-12-02 11:33:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:33:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:49,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:33:49,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:33:49,572 INFO L87 Difference]: Start difference. First operand 337 states and 470 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 11:33:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:49,595 INFO L93 Difference]: Finished difference Result 913 states and 1276 transitions. [2024-12-02 11:33:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:33:49,595 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 11:33:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:49,598 INFO L225 Difference]: With dead ends: 913 [2024-12-02 11:33:49,598 INFO L226 Difference]: Without dead ends: 601 [2024-12-02 11:33:49,599 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 11:33:49,599 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 159 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 11:33:49,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-12-02 11:33:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2024-12-02 11:33:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.3678929765886287) internal successors, (818), 598 states have internal predecessors, (818), 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 11:33:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 818 transitions. [2024-12-02 11:33:49,616 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 818 transitions. Word has length 39 [2024-12-02 11:33:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:49,616 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 818 transitions. [2024-12-02 11:33:49,616 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 11:33:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 818 transitions. [2024-12-02 11:33:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-02 11:33:49,617 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:49,618 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] [2024-12-02 11:33:49,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:33:49,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:49,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2108144598, now seen corresponding path program 1 times [2024-12-02 11:33:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604734600] [2024-12-02 11:33:49,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 11:33:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604734600] [2024-12-02 11:33:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604734600] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:33:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910758930] [2024-12-02 11:33:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:49,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:33:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:49,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:33:49,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:33:49,719 INFO L87 Difference]: Start difference. First operand 599 states and 818 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 11:33:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:49,812 INFO L93 Difference]: Finished difference Result 2299 states and 3162 transitions. [2024-12-02 11:33:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:33:49,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 55 [2024-12-02 11:33:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:49,818 INFO L225 Difference]: With dead ends: 2299 [2024-12-02 11:33:49,818 INFO L226 Difference]: Without dead ends: 1881 [2024-12-02 11:33:49,819 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 11:33:49,819 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 164 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:33:49,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 288 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2024-12-02 11:33:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1095. [2024-12-02 11:33:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.3656307129798904) internal successors, (1494), 1094 states have internal predecessors, (1494), 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 11:33:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1494 transitions. [2024-12-02 11:33:49,863 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1494 transitions. Word has length 55 [2024-12-02 11:33:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:49,863 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1494 transitions. [2024-12-02 11:33:49,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 11:33:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1494 transitions. [2024-12-02 11:33:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-02 11:33:49,864 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:49,864 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] [2024-12-02 11:33:49,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:33:49,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:49,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash -107324202, now seen corresponding path program 1 times [2024-12-02 11:33:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:49,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038421845] [2024-12-02 11:33:49,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 11:33:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038421845] [2024-12-02 11:33:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038421845] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:49,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:33:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743662792] [2024-12-02 11:33:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:33:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:49,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:33:49,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:33:49,961 INFO L87 Difference]: Start difference. First operand 1095 states and 1494 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 11:33:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:50,065 INFO L93 Difference]: Finished difference Result 2871 states and 3946 transitions. [2024-12-02 11:33:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:33:50,066 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 55 [2024-12-02 11:33:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:50,071 INFO L225 Difference]: With dead ends: 2871 [2024-12-02 11:33:50,071 INFO L226 Difference]: Without dead ends: 2297 [2024-12-02 11:33:50,072 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 11:33:50,073 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 164 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 284 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 11:33:50,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 284 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:50,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-12-02 11:33:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1875. [2024-12-02 11:33:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1874 states have (on average 1.3628601921024546) internal successors, (2554), 1874 states have internal predecessors, (2554), 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 11:33:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2554 transitions. [2024-12-02 11:33:50,128 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2554 transitions. Word has length 55 [2024-12-02 11:33:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:50,128 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2554 transitions. [2024-12-02 11:33:50,128 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 11:33:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2554 transitions. [2024-12-02 11:33:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-02 11:33:50,129 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:50,129 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] [2024-12-02 11:33:50,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:33:50,130 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:50,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1673608662, now seen corresponding path program 1 times [2024-12-02 11:33:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129193230] [2024-12-02 11:33:50,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 11:33:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129193230] [2024-12-02 11:33:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129193230] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:50,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:33:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594278655] [2024-12-02 11:33:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:33:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:50,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:33:50,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:33:50,218 INFO L87 Difference]: Start difference. First operand 1875 states and 2554 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 11:33:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:50,328 INFO L93 Difference]: Finished difference Result 3443 states and 4726 transitions. [2024-12-02 11:33:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:33:50,329 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 55 [2024-12-02 11:33:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:50,335 INFO L225 Difference]: With dead ends: 3443 [2024-12-02 11:33:50,335 INFO L226 Difference]: Without dead ends: 2869 [2024-12-02 11:33:50,336 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 11:33:50,337 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 170 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:33:50,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 286 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2024-12-02 11:33:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2447. [2024-12-02 11:33:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2446 states have (on average 1.3630417007358953) internal successors, (3334), 2446 states have internal predecessors, (3334), 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 11:33:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3334 transitions. [2024-12-02 11:33:50,412 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3334 transitions. Word has length 55 [2024-12-02 11:33:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:50,412 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3334 transitions. [2024-12-02 11:33:50,412 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 11:33:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3334 transitions. [2024-12-02 11:33:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-02 11:33:50,413 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:50,413 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 11:33:50,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:33:50,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:50,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash 919127620, now seen corresponding path program 1 times [2024-12-02 11:33:50,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:50,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252030268] [2024-12-02 11:33:50,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:33:50,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:50,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252030268] [2024-12-02 11:33:50,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252030268] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:50,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:50,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:33:50,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497628298] [2024-12-02 11:33:50,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:50,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:33:50,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:50,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:33:50,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:33:50,493 INFO L87 Difference]: Start difference. First operand 2447 states and 3334 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 11:33:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:50,549 INFO L93 Difference]: Finished difference Result 4871 states and 6644 transitions. [2024-12-02 11:33:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:33:50,549 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 11:33:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:50,555 INFO L225 Difference]: With dead ends: 4871 [2024-12-02 11:33:50,555 INFO L226 Difference]: Without dead ends: 2449 [2024-12-02 11:33:50,556 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 11:33:50,557 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 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 11:33:50,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2024-12-02 11:33:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2447. [2024-12-02 11:33:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2446 states have (on average 1.3426001635322977) internal successors, (3284), 2446 states have internal predecessors, (3284), 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 11:33:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3284 transitions. [2024-12-02 11:33:50,619 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3284 transitions. Word has length 56 [2024-12-02 11:33:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:50,619 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3284 transitions. [2024-12-02 11:33:50,619 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 11:33:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3284 transitions. [2024-12-02 11:33:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-02 11:33:50,620 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:50,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:33:50,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:33:50,621 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:50,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1408550898, now seen corresponding path program 1 times [2024-12-02 11:33:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:50,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8717388] [2024-12-02 11:33:50,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:33:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8717388] [2024-12-02 11:33:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8717388] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:50,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:50,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:33:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545121159] [2024-12-02 11:33:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:50,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:33:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:50,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:33:50,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:33:50,679 INFO L87 Difference]: Start difference. First operand 2447 states and 3284 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 11:33:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:50,708 INFO L93 Difference]: Finished difference Result 3403 states and 4581 transitions. [2024-12-02 11:33:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:33:50,708 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 11:33:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:50,711 INFO L225 Difference]: With dead ends: 3403 [2024-12-02 11:33:50,711 INFO L226 Difference]: Without dead ends: 981 [2024-12-02 11:33:50,713 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 11:33:50,713 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 144 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 11:33:50,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 144 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-12-02 11:33:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 972. [2024-12-02 11:33:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.333676622039135) internal successors, (1295), 971 states have internal predecessors, (1295), 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 11:33:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1295 transitions. [2024-12-02 11:33:50,736 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1295 transitions. Word has length 57 [2024-12-02 11:33:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:50,736 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1295 transitions. [2024-12-02 11:33:50,736 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 11:33:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1295 transitions. [2024-12-02 11:33:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-02 11:33:50,737 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:50,737 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, 1] [2024-12-02 11:33:50,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 11:33:50,737 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:50,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1062832502, now seen corresponding path program 1 times [2024-12-02 11:33:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589137473] [2024-12-02 11:33:50,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:33:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589137473] [2024-12-02 11:33:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589137473] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:33:50,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:33:50,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:33:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890541255] [2024-12-02 11:33:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:33:50,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:33:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:50,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:33:50,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:33:50,798 INFO L87 Difference]: Start difference. First operand 972 states and 1295 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 11:33:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:50,818 INFO L93 Difference]: Finished difference Result 1444 states and 1927 transitions. [2024-12-02 11:33:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:33:50,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2024-12-02 11:33:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:50,820 INFO L225 Difference]: With dead ends: 1444 [2024-12-02 11:33:50,821 INFO L226 Difference]: Without dead ends: 506 [2024-12-02 11:33:50,821 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 11:33:50,822 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 123 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 11:33:50,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:33:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-12-02 11:33:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2024-12-02 11:33:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.3041749502982107) internal successors, (656), 503 states have internal predecessors, (656), 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 11:33:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 656 transitions. [2024-12-02 11:33:50,834 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 656 transitions. Word has length 58 [2024-12-02 11:33:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:50,834 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 656 transitions. [2024-12-02 11:33:50,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 11:33:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 656 transitions. [2024-12-02 11:33:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 11:33:50,835 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:50,835 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] [2024-12-02 11:33:50,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:33:50,835 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:50,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash -207437016, now seen corresponding path program 1 times [2024-12-02 11:33:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:50,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681308939] [2024-12-02 11:33:50,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:33:51,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681308939] [2024-12-02 11:33:51,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681308939] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:33:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817835967] [2024-12-02 11:33:51,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:51,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:33:51,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:33:51,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:33:51,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 11:33:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:51,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 11:33:51,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:33:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 11:33:51,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:33:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 11:33:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817835967] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:33:51,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:33:51,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2024-12-02 11:33:51,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651080786] [2024-12-02 11:33:51,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:33:51,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 11:33:51,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:51,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 11:33:51,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-12-02 11:33:51,845 INFO L87 Difference]: Start difference. First operand 504 states and 656 transitions. Second operand has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 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 11:33:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:52,814 INFO L93 Difference]: Finished difference Result 2617 states and 3382 transitions. [2024-12-02 11:33:52,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-12-02 11:33:52,815 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 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 11:33:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:52,819 INFO L225 Difference]: With dead ends: 2617 [2024-12-02 11:33:52,819 INFO L226 Difference]: Without dead ends: 2147 [2024-12-02 11:33:52,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=373, Invalid=1349, Unknown=0, NotChecked=0, Total=1722 [2024-12-02 11:33:52,822 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 1133 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:33:52,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 477 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:33:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2024-12-02 11:33:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2011. [2024-12-02 11:33:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 2010 states have (on average 1.2467661691542289) internal successors, (2506), 2010 states have internal predecessors, (2506), 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 11:33:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2506 transitions. [2024-12-02 11:33:52,879 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2506 transitions. Word has length 60 [2024-12-02 11:33:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:52,880 INFO L471 AbstractCegarLoop]: Abstraction has 2011 states and 2506 transitions. [2024-12-02 11:33:52,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 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 11:33:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2506 transitions. [2024-12-02 11:33:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 11:33:52,880 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:52,881 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 11:33:52,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 11:33:53,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 11:33:53,081 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:53,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1137688292, now seen corresponding path program 1 times [2024-12-02 11:33:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:53,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293502422] [2024-12-02 11:33:53,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:33:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293502422] [2024-12-02 11:33:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293502422] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:33:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32563668] [2024-12-02 11:33:53,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:53,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:33:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:33:53,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:33:53,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 11:33:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:53,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-12-02 11:33:53,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:33:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:33:54,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:33:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:33:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32563668] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:33:55,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:33:55,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-12-02 11:33:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858896598] [2024-12-02 11:33:55,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:33:55,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-12-02 11:33:55,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:33:55,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-12-02 11:33:55,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2024-12-02 11:33:55,110 INFO L87 Difference]: Start difference. First operand 2011 states and 2506 transitions. Second operand has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 states have internal predecessors, (168), 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 11:33:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:33:57,889 INFO L93 Difference]: Finished difference Result 7205 states and 8974 transitions. [2024-12-02 11:33:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-12-02 11:33:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 states have internal predecessors, (168), 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 11:33:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:33:57,899 INFO L225 Difference]: With dead ends: 7205 [2024-12-02 11:33:57,899 INFO L226 Difference]: Without dead ends: 5406 [2024-12-02 11:33:57,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=934, Invalid=3896, Unknown=0, NotChecked=0, Total=4830 [2024-12-02 11:33:57,903 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1277 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 11:33:57,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 833 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 11:33:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2024-12-02 11:33:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 4614. [2024-12-02 11:33:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4614 states, 4613 states have (on average 1.2195967916756991) internal successors, (5626), 4613 states have internal predecessors, (5626), 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 11:33:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 5626 transitions. [2024-12-02 11:33:58,100 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 5626 transitions. Word has length 61 [2024-12-02 11:33:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:33:58,100 INFO L471 AbstractCegarLoop]: Abstraction has 4614 states and 5626 transitions. [2024-12-02 11:33:58,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.6) internal successors, (168), 30 states have internal predecessors, (168), 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 11:33:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5626 transitions. [2024-12-02 11:33:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 11:33:58,101 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:33:58,101 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, 1] [2024-12-02 11:33:58,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 11:33:58,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 11:33:58,302 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:33:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:33:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash 580574178, now seen corresponding path program 1 times [2024-12-02 11:33:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:33:58,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468261515] [2024-12-02 11:33:58,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:33:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:33:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:33:59,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468261515] [2024-12-02 11:33:59,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468261515] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:33:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134631448] [2024-12-02 11:33:59,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:33:59,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:33:59,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:33:59,235 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:33:59,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 11:33:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:33:59,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 11:33:59,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:34:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:34:00,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:34:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:34:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134631448] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:34:03,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:34:03,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 50 [2024-12-02 11:34:03,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446370571] [2024-12-02 11:34:03,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:34:03,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-12-02 11:34:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:34:03,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-12-02 11:34:03,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2241, Unknown=0, NotChecked=0, Total=2450 [2024-12-02 11:34:03,228 INFO L87 Difference]: Start difference. First operand 4614 states and 5626 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 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 11:34:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:34:46,490 INFO L93 Difference]: Finished difference Result 15589 states and 19101 transitions. [2024-12-02 11:34:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2024-12-02 11:34:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 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 62 [2024-12-02 11:34:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:34:46,513 INFO L225 Difference]: With dead ends: 15589 [2024-12-02 11:34:46,513 INFO L226 Difference]: Without dead ends: 11556 [2024-12-02 11:34:46,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20491 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=9218, Invalid=45304, Unknown=0, NotChecked=0, Total=54522 [2024-12-02 11:34:46,523 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 4464 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 4076 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4464 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 4230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 4076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:34:46,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4464 Valid, 3466 Invalid, 4230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 4076 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-12-02 11:34:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2024-12-02 11:34:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 3148. [2024-12-02 11:34:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.2224340641881157) internal successors, (3847), 3147 states have internal predecessors, (3847), 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 11:34:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3847 transitions. [2024-12-02 11:34:46,727 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3847 transitions. Word has length 62 [2024-12-02 11:34:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:34:46,727 INFO L471 AbstractCegarLoop]: Abstraction has 3148 states and 3847 transitions. [2024-12-02 11:34:46,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 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 11:34:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3847 transitions. [2024-12-02 11:34:46,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 11:34:46,728 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:34:46,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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 11:34:46,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 11:34:46,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 11:34:46,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:34:46,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:34:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1448215816, now seen corresponding path program 1 times [2024-12-02 11:34:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:34:46,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733983819] [2024-12-02 11:34:46,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:34:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:34:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:34:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 39 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:34:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:34:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733983819] [2024-12-02 11:34:47,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733983819] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:34:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845553318] [2024-12-02 11:34:47,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:34:47,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:34:47,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:34:47,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:34:47,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 11:34:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:34:48,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-12-02 11:34:48,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:34:49,696 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 11:34:49,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:34:52,490 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 11:34:52,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845553318] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:34:52,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:34:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 49 [2024-12-02 11:34:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958279443] [2024-12-02 11:34:52,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:34:52,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-12-02 11:34:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:34:52,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-12-02 11:34:52,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2146, Unknown=0, NotChecked=0, Total=2352 [2024-12-02 11:34:52,491 INFO L87 Difference]: Start difference. First operand 3148 states and 3847 transitions. Second operand has 49 states, 49 states have (on average 5.8979591836734695) internal successors, (289), 49 states have internal predecessors, (289), 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 11:35:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:35:11,536 INFO L93 Difference]: Finished difference Result 7119 states and 8709 transitions. [2024-12-02 11:35:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-12-02 11:35:11,537 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.8979591836734695) internal successors, (289), 49 states have internal predecessors, (289), 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 11:35:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:35:11,546 INFO L225 Difference]: With dead ends: 7119 [2024-12-02 11:35:11,546 INFO L226 Difference]: Without dead ends: 5935 [2024-12-02 11:35:11,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8047 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=4106, Invalid=21654, Unknown=0, NotChecked=0, Total=25760 [2024-12-02 11:35:11,549 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 2733 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-12-02 11:35:11,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 2359 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-12-02 11:35:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5935 states. [2024-12-02 11:35:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5935 to 2507. [2024-12-02 11:35:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.1999201915403033) internal successors, (3007), 2506 states have internal predecessors, (3007), 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 11:35:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3007 transitions. [2024-12-02 11:35:11,677 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3007 transitions. Word has length 103 [2024-12-02 11:35:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:35:11,677 INFO L471 AbstractCegarLoop]: Abstraction has 2507 states and 3007 transitions. [2024-12-02 11:35:11,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.8979591836734695) internal successors, (289), 49 states have internal predecessors, (289), 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 11:35:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3007 transitions. [2024-12-02 11:35:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 11:35:11,679 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:35:11,679 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-12-02 11:35:11,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 11:35:11,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:35:11,879 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:35:11,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:35:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1151916394, now seen corresponding path program 1 times [2024-12-02 11:35:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:35:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162666578] [2024-12-02 11:35:11,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:35:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:35:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:35:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 26 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:35:12,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162666578] [2024-12-02 11:35:12,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162666578] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:35:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344883709] [2024-12-02 11:35:12,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:35:12,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:35:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:35:12,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:35:12,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 11:35:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:35:12,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 11:35:12,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:35:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:13,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:35:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:15,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344883709] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:35:15,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:35:15,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 37 [2024-12-02 11:35:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920792964] [2024-12-02 11:35:15,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:35:15,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-12-02 11:35:15,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:35:15,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-12-02 11:35:15,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2024-12-02 11:35:15,542 INFO L87 Difference]: Start difference. First operand 2507 states and 3007 transitions. Second operand has 37 states, 37 states have (on average 7.783783783783784) internal successors, (288), 37 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 11:35:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:35:22,504 INFO L93 Difference]: Finished difference Result 16303 states and 19704 transitions. [2024-12-02 11:35:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-12-02 11:35:22,505 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.783783783783784) internal successors, (288), 37 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 103 [2024-12-02 11:35:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:35:22,521 INFO L225 Difference]: With dead ends: 16303 [2024-12-02 11:35:22,521 INFO L226 Difference]: Without dead ends: 14270 [2024-12-02 11:35:22,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2096, Invalid=9894, Unknown=0, NotChecked=0, Total=11990 [2024-12-02 11:35:22,524 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1631 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:35:22,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 2306 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 11:35:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14270 states. [2024-12-02 11:35:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14270 to 10906. [2024-12-02 11:35:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10906 states, 10905 states have (on average 1.2002751031636865) internal successors, (13089), 10905 states have internal predecessors, (13089), 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 11:35:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10906 states to 10906 states and 13089 transitions. [2024-12-02 11:35:23,222 INFO L78 Accepts]: Start accepts. Automaton has 10906 states and 13089 transitions. Word has length 103 [2024-12-02 11:35:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:35:23,222 INFO L471 AbstractCegarLoop]: Abstraction has 10906 states and 13089 transitions. [2024-12-02 11:35:23,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.783783783783784) internal successors, (288), 37 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 11:35:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10906 states and 13089 transitions. [2024-12-02 11:35:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 11:35:23,224 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:35:23,224 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 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 11:35:23,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 11:35:23,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:35:23,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:35:23,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:35:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2069183626, now seen corresponding path program 1 times [2024-12-02 11:35:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:35:23,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017118350] [2024-12-02 11:35:23,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:35:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:35:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:35:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:24,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:35:24,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017118350] [2024-12-02 11:35:24,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017118350] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:35:24,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762947328] [2024-12-02 11:35:24,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:35:24,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:35:24,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:35:24,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:35:24,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 11:35:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:35:24,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-02 11:35:24,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:35:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:25,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:35:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:26,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762947328] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:35:26,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:35:26,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2024-12-02 11:35:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687953739] [2024-12-02 11:35:26,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:35:26,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 11:35:26,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:35:26,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 11:35:26,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-12-02 11:35:26,095 INFO L87 Difference]: Start difference. First operand 10906 states and 13089 transitions. Second operand has 29 states, 29 states have (on average 8.586206896551724) internal successors, (249), 29 states have internal predecessors, (249), 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 11:35:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:35:29,369 INFO L93 Difference]: Finished difference Result 23942 states and 28761 transitions. [2024-12-02 11:35:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-12-02 11:35:29,370 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.586206896551724) internal successors, (249), 29 states have internal predecessors, (249), 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 11:35:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:35:29,396 INFO L225 Difference]: With dead ends: 23942 [2024-12-02 11:35:29,396 INFO L226 Difference]: Without dead ends: 13650 [2024-12-02 11:35:29,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=673, Invalid=2749, Unknown=0, NotChecked=0, Total=3422 [2024-12-02 11:35:29,403 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 962 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 11:35:29,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1098 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 11:35:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13650 states. [2024-12-02 11:35:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13650 to 7389. [2024-12-02 11:35:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7389 states, 7388 states have (on average 1.1963995668651868) internal successors, (8839), 7388 states have internal predecessors, (8839), 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 11:35:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 8839 transitions. [2024-12-02 11:35:29,946 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 8839 transitions. Word has length 104 [2024-12-02 11:35:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:35:29,946 INFO L471 AbstractCegarLoop]: Abstraction has 7389 states and 8839 transitions. [2024-12-02 11:35:29,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.586206896551724) internal successors, (249), 29 states have internal predecessors, (249), 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 11:35:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 8839 transitions. [2024-12-02 11:35:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 11:35:29,949 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:35:29,949 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-12-02 11:35:29,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 11:35:30,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:35:30,150 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:35:30,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:35:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash 879843668, now seen corresponding path program 1 times [2024-12-02 11:35:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:35:30,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960254092] [2024-12-02 11:35:30,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:35:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:35:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:35:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:35:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960254092] [2024-12-02 11:35:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960254092] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:35:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589101146] [2024-12-02 11:35:32,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:35:32,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:35:32,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:35:32,008 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:35:32,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 11:35:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:35:32,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-12-02 11:35:32,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:35:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 34 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:35,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:35:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 25 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:35:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589101146] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:35:45,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:35:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 28] total 81 [2024-12-02 11:35:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932163670] [2024-12-02 11:35:45,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:35:45,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-12-02 11:35:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:35:45,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-12-02 11:35:45,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=6005, Unknown=0, NotChecked=0, Total=6480 [2024-12-02 11:35:45,010 INFO L87 Difference]: Start difference. First operand 7389 states and 8839 transitions. Second operand has 81 states, 81 states have (on average 3.617283950617284) internal successors, (293), 81 states have internal predecessors, (293), 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 11:37:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:37:34,255 INFO L93 Difference]: Finished difference Result 21638 states and 26081 transitions. [2024-12-02 11:37:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-12-02 11:37:34,256 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.617283950617284) internal successors, (293), 81 states have internal predecessors, (293), 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 11:37:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:37:34,271 INFO L225 Difference]: With dead ends: 21638 [2024-12-02 11:37:34,271 INFO L226 Difference]: Without dead ends: 15279 [2024-12-02 11:37:34,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23702 ImplicationChecksByTransitivity, 108.0s TimeCoverageRelationStatistics Valid=11239, Invalid=63563, Unknown=0, NotChecked=0, Total=74802 [2024-12-02 11:37:34,278 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 4171 mSDsluCounter, 6685 mSDsCounter, 0 mSdLazyCounter, 5549 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4171 SdHoareTripleChecker+Valid, 6884 SdHoareTripleChecker+Invalid, 5828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 5549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:37:34,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4171 Valid, 6884 Invalid, 5828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 5549 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-12-02 11:37:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15279 states. [2024-12-02 11:37:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15279 to 9860. [2024-12-02 11:37:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9860 states, 9859 states have (on average 1.1989045542144234) internal successors, (11820), 9859 states have internal predecessors, (11820), 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 11:37:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 11820 transitions. [2024-12-02 11:37:35,215 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 11820 transitions. Word has length 104 [2024-12-02 11:37:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:37:35,216 INFO L471 AbstractCegarLoop]: Abstraction has 9860 states and 11820 transitions. [2024-12-02 11:37:35,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.617283950617284) internal successors, (293), 81 states have internal predecessors, (293), 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 11:37:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 11820 transitions. [2024-12-02 11:37:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 11:37:35,218 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:37:35,218 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-12-02 11:37:35,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-12-02 11:37:35,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:37:35,419 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:37:35,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:37:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2107819364, now seen corresponding path program 1 times [2024-12-02 11:37:35,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:37:35,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341366367] [2024-12-02 11:37:35,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:37:35,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:37:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:37:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:37:36,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:37:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341366367] [2024-12-02 11:37:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341366367] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:37:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24879287] [2024-12-02 11:37:36,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:37:36,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:37:36,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:37:36,953 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:37:36,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 11:37:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:37:37,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 11:37:37,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:37:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:37:40,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:37:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:37:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24879287] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:37:45,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:37:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 20] total 63 [2024-12-02 11:37:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28595413] [2024-12-02 11:37:45,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:37:45,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-12-02 11:37:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:37:45,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-12-02 11:37:45,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=3600, Unknown=0, NotChecked=0, Total=3906 [2024-12-02 11:37:45,741 INFO L87 Difference]: Start difference. First operand 9860 states and 11820 transitions. Second operand has 63 states, 63 states have (on average 4.634920634920635) internal successors, (292), 63 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 11:37:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:37:59,291 INFO L93 Difference]: Finished difference Result 12193 states and 14648 transitions. [2024-12-02 11:37:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-12-02 11:37:59,292 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.634920634920635) internal successors, (292), 63 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 104 [2024-12-02 11:37:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:37:59,299 INFO L225 Difference]: With dead ends: 12193 [2024-12-02 11:37:59,299 INFO L226 Difference]: Without dead ends: 9965 [2024-12-02 11:37:59,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2588 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=1707, Invalid=10283, Unknown=0, NotChecked=0, Total=11990 [2024-12-02 11:37:59,301 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1378 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:37:59,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 2077 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-12-02 11:37:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2024-12-02 11:38:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 9870. [2024-12-02 11:38:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9870 states, 9869 states have (on average 1.1988043368122403) internal successors, (11831), 9869 states have internal predecessors, (11831), 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 11:38:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9870 states to 9870 states and 11831 transitions. [2024-12-02 11:38:00,231 INFO L78 Accepts]: Start accepts. Automaton has 9870 states and 11831 transitions. Word has length 104 [2024-12-02 11:38:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:38:00,231 INFO L471 AbstractCegarLoop]: Abstraction has 9870 states and 11831 transitions. [2024-12-02 11:38:00,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.634920634920635) internal successors, (292), 63 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 11:38:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 9870 states and 11831 transitions. [2024-12-02 11:38:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 11:38:00,233 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:38:00,233 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 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 11:38:00,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 11:38:00,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-02 11:38:00,433 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:38:00,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:38:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash -964567968, now seen corresponding path program 1 times [2024-12-02 11:38:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:38:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331210422] [2024-12-02 11:38:00,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:38:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:38:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:38:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:38:00,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:38:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331210422] [2024-12-02 11:38:00,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331210422] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:38:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243535434] [2024-12-02 11:38:00,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:38:00,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:38:00,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:38:00,993 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:38:00,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 11:38:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:38:01,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 11:38:01,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:38:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:38:02,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:38:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:38:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243535434] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:38:03,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:38:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 39 [2024-12-02 11:38:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378223526] [2024-12-02 11:38:03,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:38:03,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-12-02 11:38:03,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:38:03,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-12-02 11:38:03,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2024-12-02 11:38:03,676 INFO L87 Difference]: Start difference. First operand 9870 states and 11831 transitions. Second operand has 39 states, 39 states have (on average 7.358974358974359) internal successors, (287), 39 states have internal predecessors, (287), 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 11:38:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:38:08,898 INFO L93 Difference]: Finished difference Result 24179 states and 29113 transitions. [2024-12-02 11:38:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-12-02 11:38:08,899 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.358974358974359) internal successors, (287), 39 states have internal predecessors, (287), 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 11:38:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:38:08,909 INFO L225 Difference]: With dead ends: 24179 [2024-12-02 11:38:08,909 INFO L226 Difference]: Without dead ends: 16340 [2024-12-02 11:38:08,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1629, Invalid=9501, Unknown=0, NotChecked=0, Total=11130 [2024-12-02 11:38:08,913 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1566 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 11:38:08,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 1789 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 11:38:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16340 states. [2024-12-02 11:38:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16340 to 13365. [2024-12-02 11:38:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13365 states, 13364 states have (on average 1.1883418138281951) internal successors, (15881), 13364 states have internal predecessors, (15881), 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 11:38:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13365 states to 13365 states and 15881 transitions. [2024-12-02 11:38:10,417 INFO L78 Accepts]: Start accepts. Automaton has 13365 states and 15881 transitions. Word has length 105 [2024-12-02 11:38:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:38:10,418 INFO L471 AbstractCegarLoop]: Abstraction has 13365 states and 15881 transitions. [2024-12-02 11:38:10,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.358974358974359) internal successors, (287), 39 states have internal predecessors, (287), 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 11:38:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 13365 states and 15881 transitions. [2024-12-02 11:38:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 11:38:10,419 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:38:10,419 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 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 11:38:10,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 11:38:10,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 11:38:10,619 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:38:10,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:38:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1399271496, now seen corresponding path program 1 times [2024-12-02 11:38:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:38:10,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447560933] [2024-12-02 11:38:10,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:38:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:38:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:38:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:38:11,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:38:11,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447560933] [2024-12-02 11:38:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447560933] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:38:11,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405325763] [2024-12-02 11:38:11,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:38:11,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:38:11,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:38:11,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:38:11,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 11:38:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:38:12,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-12-02 11:38:12,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:38:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:38:15,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:38:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:38:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405325763] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:38:19,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:38:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 19] total 65 [2024-12-02 11:38:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386407356] [2024-12-02 11:38:19,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:38:19,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-12-02 11:38:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:38:19,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-12-02 11:38:19,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=3853, Unknown=0, NotChecked=0, Total=4160 [2024-12-02 11:38:19,609 INFO L87 Difference]: Start difference. First operand 13365 states and 15881 transitions. Second operand has 65 states, 65 states have (on average 4.338461538461538) internal successors, (282), 65 states have internal predecessors, (282), 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 11:39:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:39:47,137 INFO L93 Difference]: Finished difference Result 38303 states and 45443 transitions. [2024-12-02 11:39:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2024-12-02 11:39:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 4.338461538461538) internal successors, (282), 65 states have internal predecessors, (282), 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 11:39:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:39:47,155 INFO L225 Difference]: With dead ends: 38303 [2024-12-02 11:39:47,155 INFO L226 Difference]: Without dead ends: 30799 [2024-12-02 11:39:47,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44931 ImplicationChecksByTransitivity, 82.2s TimeCoverageRelationStatistics Valid=15532, Invalid=99728, Unknown=0, NotChecked=0, Total=115260 [2024-12-02 11:39:47,162 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 5953 mSDsluCounter, 5532 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5953 SdHoareTripleChecker+Valid, 5708 SdHoareTripleChecker+Invalid, 4709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-12-02 11:39:47,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5953 Valid, 5708 Invalid, 4709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-12-02 11:39:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30799 states. [2024-12-02 11:39:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30799 to 15880. [2024-12-02 11:39:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15880 states, 15879 states have (on average 1.1861578185024246) internal successors, (18835), 15879 states have internal predecessors, (18835), 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 11:39:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15880 states to 15880 states and 18835 transitions. [2024-12-02 11:39:49,037 INFO L78 Accepts]: Start accepts. Automaton has 15880 states and 18835 transitions. Word has length 105 [2024-12-02 11:39:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:39:49,038 INFO L471 AbstractCegarLoop]: Abstraction has 15880 states and 18835 transitions. [2024-12-02 11:39:49,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 4.338461538461538) internal successors, (282), 65 states have internal predecessors, (282), 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 11:39:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 15880 states and 18835 transitions. [2024-12-02 11:39:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 11:39:49,039 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:39:49,039 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-12-02 11:39:49,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-12-02 11:39:49,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 11:39:49,239 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:39:49,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:39:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1622892984, now seen corresponding path program 1 times [2024-12-02 11:39:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:39:49,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298621990] [2024-12-02 11:39:49,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:39:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 26 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:39:50,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:39:50,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298621990] [2024-12-02 11:39:50,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298621990] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:39:50,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538452417] [2024-12-02 11:39:50,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:39:50,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:39:50,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:39:50,359 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:39:50,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 11:39:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:39:50,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 11:39:50,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:39:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 26 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:39:52,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:39:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:39:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538452417] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:39:58,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:39:58,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 64 [2024-12-02 11:39:58,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140534055] [2024-12-02 11:39:58,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:39:58,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-12-02 11:39:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:39:58,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-12-02 11:39:58,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=3725, Unknown=0, NotChecked=0, Total=4032 [2024-12-02 11:39:58,651 INFO L87 Difference]: Start difference. First operand 15880 states and 18835 transitions. Second operand has 64 states, 64 states have (on average 4.65625) internal successors, (298), 64 states have internal predecessors, (298), 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 11:41:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:41:05,754 INFO L93 Difference]: Finished difference Result 42237 states and 50658 transitions. [2024-12-02 11:41:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2024-12-02 11:41:05,755 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 4.65625) internal successors, (298), 64 states have internal predecessors, (298), 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 106 [2024-12-02 11:41:05,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:41:05,776 INFO L225 Difference]: With dead ends: 42237 [2024-12-02 11:41:05,776 INFO L226 Difference]: Without dead ends: 30647 [2024-12-02 11:41:05,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33766 ImplicationChecksByTransitivity, 61.8s TimeCoverageRelationStatistics Valid=15887, Invalid=73813, Unknown=0, NotChecked=0, Total=89700 [2024-12-02 11:41:05,784 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 4371 mSDsluCounter, 4528 mSDsCounter, 0 mSdLazyCounter, 4781 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4371 SdHoareTripleChecker+Valid, 4675 SdHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 4781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:41:05,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4371 Valid, 4675 Invalid, 4965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 4781 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-12-02 11:41:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30647 states. [2024-12-02 11:41:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30647 to 17717. [2024-12-02 11:41:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17717 states, 17716 states have (on average 1.1910137728606909) internal successors, (21100), 17716 states have internal predecessors, (21100), 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 11:41:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17717 states to 17717 states and 21100 transitions. [2024-12-02 11:41:07,964 INFO L78 Accepts]: Start accepts. Automaton has 17717 states and 21100 transitions. Word has length 106 [2024-12-02 11:41:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:41:07,965 INFO L471 AbstractCegarLoop]: Abstraction has 17717 states and 21100 transitions. [2024-12-02 11:41:07,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.65625) internal successors, (298), 64 states have internal predecessors, (298), 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 11:41:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17717 states and 21100 transitions. [2024-12-02 11:41:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 11:41:07,966 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:41:07,966 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-12-02 11:41:07,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-12-02 11:41:08,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 11:41:08,167 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:41:08,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:41:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -137206902, now seen corresponding path program 1 times [2024-12-02 11:41:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:41:08,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860832575] [2024-12-02 11:41:08,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:41:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:41:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:41:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:41:09,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:41:09,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860832575] [2024-12-02 11:41:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860832575] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:41:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864864780] [2024-12-02 11:41:09,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:41:09,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:41:09,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:41:09,238 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:41:09,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 11:41:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:41:09,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-12-02 11:41:09,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:41:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:41:12,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:41:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:41:21,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864864780] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:41:21,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:41:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29, 28] total 74 [2024-12-02 11:41:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345604253] [2024-12-02 11:41:21,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:41:21,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-12-02 11:41:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:41:21,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-12-02 11:41:21,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=4755, Unknown=0, NotChecked=0, Total=5402 [2024-12-02 11:41:21,844 INFO L87 Difference]: Start difference. First operand 17717 states and 21100 transitions. Second operand has 74 states, 74 states have (on average 3.9864864864864864) internal successors, (295), 74 states have internal predecessors, (295), 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 11:42:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:22,198 INFO L93 Difference]: Finished difference Result 35511 states and 42290 transitions. [2024-12-02 11:42:22,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-12-02 11:42:22,199 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 3.9864864864864864) internal successors, (295), 74 states have internal predecessors, (295), 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 106 [2024-12-02 11:42:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:22,219 INFO L225 Difference]: With dead ends: 35511 [2024-12-02 11:42:22,220 INFO L226 Difference]: Without dead ends: 28433 [2024-12-02 11:42:22,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18168 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=11022, Invalid=40734, Unknown=0, NotChecked=0, Total=51756 [2024-12-02 11:42:22,226 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 3182 mSDsluCounter, 4451 mSDsCounter, 0 mSdLazyCounter, 4556 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3182 SdHoareTripleChecker+Valid, 4625 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 4556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:22,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3182 Valid, 4625 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 4556 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-12-02 11:42:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28433 states. [2024-12-02 11:42:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28433 to 18604. [2024-12-02 11:42:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18604 states, 18603 states have (on average 1.1916357576734935) internal successors, (22168), 18603 states have internal predecessors, (22168), 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 11:42:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18604 states to 18604 states and 22168 transitions. [2024-12-02 11:42:24,773 INFO L78 Accepts]: Start accepts. Automaton has 18604 states and 22168 transitions. Word has length 106 [2024-12-02 11:42:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:24,774 INFO L471 AbstractCegarLoop]: Abstraction has 18604 states and 22168 transitions. [2024-12-02 11:42:24,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 3.9864864864864864) internal successors, (295), 74 states have internal predecessors, (295), 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 11:42:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 18604 states and 22168 transitions. [2024-12-02 11:42:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 11:42:24,774 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:24,775 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-12-02 11:42:24,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-12-02 11:42:24,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 11:42:24,975 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:24,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash 191040524, now seen corresponding path program 1 times [2024-12-02 11:42:24,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:24,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961737226] [2024-12-02 11:42:24,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:26,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:26,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961737226] [2024-12-02 11:42:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961737226] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:42:26,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529220784] [2024-12-02 11:42:26,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:26,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:42:26,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:42:26,784 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:42:26,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 11:42:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:26,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-12-02 11:42:26,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:42:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 23 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:28,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:42:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529220784] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:42:32,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:42:32,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 62 [2024-12-02 11:42:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827471601] [2024-12-02 11:42:32,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:42:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-12-02 11:42:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:32,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-12-02 11:42:32,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3497, Unknown=0, NotChecked=0, Total=3782 [2024-12-02 11:42:32,649 INFO L87 Difference]: Start difference. First operand 18604 states and 22168 transitions. Second operand has 62 states, 62 states have (on average 4.419354838709677) internal successors, (274), 62 states have internal predecessors, (274), 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 11:42:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:46,649 INFO L93 Difference]: Finished difference Result 26519 states and 31670 transitions. [2024-12-02 11:42:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-12-02 11:42:46,650 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.419354838709677) internal successors, (274), 62 states have internal predecessors, (274), 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 11:42:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:46,662 INFO L225 Difference]: With dead ends: 26519 [2024-12-02 11:42:46,662 INFO L226 Difference]: Without dead ends: 19944 [2024-12-02 11:42:46,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1622, Invalid=12898, Unknown=0, NotChecked=0, Total=14520 [2024-12-02 11:42:46,666 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1187 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:46,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 3082 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 11:42:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19944 states. [2024-12-02 11:42:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19944 to 18637. [2024-12-02 11:42:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18637 states, 18636 states have (on average 1.1912427559562138) internal successors, (22200), 18636 states have internal predecessors, (22200), 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 11:42:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18637 states to 18637 states and 22200 transitions. [2024-12-02 11:42:49,124 INFO L78 Accepts]: Start accepts. Automaton has 18637 states and 22200 transitions. Word has length 107 [2024-12-02 11:42:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:49,125 INFO L471 AbstractCegarLoop]: Abstraction has 18637 states and 22200 transitions. [2024-12-02 11:42:49,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.419354838709677) internal successors, (274), 62 states have internal predecessors, (274), 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 11:42:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 18637 states and 22200 transitions. [2024-12-02 11:42:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 11:42:49,126 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:49,126 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-12-02 11:42:49,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 11:42:49,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 11:42:49,326 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:49,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539020, now seen corresponding path program 1 times [2024-12-02 11:42:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:49,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985688082] [2024-12-02 11:42:49,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:49,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985688082] [2024-12-02 11:42:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985688082] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:42:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257581002] [2024-12-02 11:42:50,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:50,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:42:50,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:42:50,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:42:50,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 11:42:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:50,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-02 11:42:50,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:42:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:52,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:42:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257581002] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:42:56,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:42:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 55 [2024-12-02 11:42:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565490726] [2024-12-02 11:42:56,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:42:56,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-12-02 11:42:56,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:56,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-12-02 11:42:56,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2736, Unknown=0, NotChecked=0, Total=2970 [2024-12-02 11:42:56,094 INFO L87 Difference]: Start difference. First operand 18637 states and 22200 transitions. Second operand has 55 states, 55 states have (on average 4.8545454545454545) internal successors, (267), 55 states have internal predecessors, (267), 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 11:43:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:43:23,426 INFO L93 Difference]: Finished difference Result 33916 states and 40625 transitions. [2024-12-02 11:43:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-12-02 11:43:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.8545454545454545) internal successors, (267), 55 states have internal predecessors, (267), 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 11:43:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:43:23,445 INFO L225 Difference]: With dead ends: 33916 [2024-12-02 11:43:23,446 INFO L226 Difference]: Without dead ends: 24802 [2024-12-02 11:43:23,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8556 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=6244, Invalid=24206, Unknown=0, NotChecked=0, Total=30450 [2024-12-02 11:43:23,453 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 2748 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2748 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 2987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:43:23,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2748 Valid, 3156 Invalid, 2987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-12-02 11:43:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24802 states. [2024-12-02 11:43:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24802 to 17137. [2024-12-02 11:43:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17137 states, 17136 states have (on average 1.1931022408963585) internal successors, (20445), 17136 states have internal predecessors, (20445), 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 11:43:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17137 states to 17137 states and 20445 transitions. [2024-12-02 11:43:26,846 INFO L78 Accepts]: Start accepts. Automaton has 17137 states and 20445 transitions. Word has length 107 [2024-12-02 11:43:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:43:26,847 INFO L471 AbstractCegarLoop]: Abstraction has 17137 states and 20445 transitions. [2024-12-02 11:43:26,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.8545454545454545) internal successors, (267), 55 states have internal predecessors, (267), 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 11:43:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 17137 states and 20445 transitions. [2024-12-02 11:43:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 11:43:26,851 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:43:26,852 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 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] [2024-12-02 11:43:26,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 11:43:27,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 11:43:27,052 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:43:27,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:43:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash -616907784, now seen corresponding path program 1 times [2024-12-02 11:43:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:43:27,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963009522] [2024-12-02 11:43:27,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:43:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:43:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:43:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 37 proven. 213 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 11:43:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:43:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963009522] [2024-12-02 11:43:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963009522] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:43:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924974388] [2024-12-02 11:43:27,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:43:27,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:43:27,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:43:27,630 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:43:27,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 11:43:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:43:27,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 11:43:27,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:43:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 82 proven. 154 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-02 11:43:28,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:43:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 37 proven. 199 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-02 11:43:31,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924974388] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:43:31,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:43:31,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-12-02 11:43:31,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155173591] [2024-12-02 11:43:31,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:43:31,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 11:43:31,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:43:31,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 11:43:31,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2024-12-02 11:43:31,253 INFO L87 Difference]: Start difference. First operand 17137 states and 20445 transitions. Second operand has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 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 11:43:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:43:34,452 INFO L93 Difference]: Finished difference Result 25949 states and 31121 transitions. [2024-12-02 11:43:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 11:43:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 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 11:43:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:43:34,464 INFO L225 Difference]: With dead ends: 25949 [2024-12-02 11:43:34,464 INFO L226 Difference]: Without dead ends: 17266 [2024-12-02 11:43:34,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2024-12-02 11:43:34,469 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 525 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:43:34,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 704 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:43:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17266 states. [2024-12-02 11:43:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17266 to 17137. [2024-12-02 11:43:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17137 states, 17136 states have (on average 1.1846988795518207) internal successors, (20301), 17136 states have internal predecessors, (20301), 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 11:43:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17137 states to 17137 states and 20301 transitions. [2024-12-02 11:43:36,903 INFO L78 Accepts]: Start accepts. Automaton has 17137 states and 20301 transitions. Word has length 146 [2024-12-02 11:43:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:43:36,903 INFO L471 AbstractCegarLoop]: Abstraction has 17137 states and 20301 transitions. [2024-12-02 11:43:36,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 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 11:43:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 17137 states and 20301 transitions. [2024-12-02 11:43:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 11:43:36,906 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:43:36,906 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:43:36,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 11:43:37,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:43:37,107 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:43:37,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:43:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2116474254, now seen corresponding path program 1 times [2024-12-02 11:43:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:43:37,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846600582] [2024-12-02 11:43:37,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:43:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:43:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:43:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 39 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:43:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:43:37,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846600582] [2024-12-02 11:43:37,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846600582] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:43:37,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318737002] [2024-12-02 11:43:37,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:43:37,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:43:37,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:43:37,924 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:43:37,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 11:43:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:43:38,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-12-02 11:43:38,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:43:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 145 proven. 69 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-02 11:43:40,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:43:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 27 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:43:48,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318737002] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:43:48,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 11:43:48,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 30] total 70 [2024-12-02 11:43:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845973063] [2024-12-02 11:43:48,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 11:43:48,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-12-02 11:43:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:43:48,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-12-02 11:43:48,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=4265, Unknown=0, NotChecked=0, Total=4830 [2024-12-02 11:43:48,393 INFO L87 Difference]: Start difference. First operand 17137 states and 20301 transitions. Second operand has 70 states, 70 states have (on average 5.742857142857143) internal successors, (402), 70 states have internal predecessors, (402), 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 11:44:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:44:01,562 INFO L93 Difference]: Finished difference Result 23936 states and 28378 transitions. [2024-12-02 11:44:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-12-02 11:44:01,563 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 5.742857142857143) internal successors, (402), 70 states have internal predecessors, (402), 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 11:44:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:44:01,576 INFO L225 Difference]: With dead ends: 23936 [2024-12-02 11:44:01,576 INFO L226 Difference]: Without dead ends: 19001 [2024-12-02 11:44:01,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=4846, Invalid=21560, Unknown=0, NotChecked=0, Total=26406 [2024-12-02 11:44:01,581 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 2171 mSDsluCounter, 3584 mSDsCounter, 0 mSdLazyCounter, 3573 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 3764 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:44:01,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 3764 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3573 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-12-02 11:44:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19001 states. [2024-12-02 11:44:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19001 to 12849. [2024-12-02 11:44:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12849 states, 12848 states have (on average 1.1827521793275217) internal successors, (15196), 12848 states have internal predecessors, (15196), 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 11:44:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12849 states to 12849 states and 15196 transitions. [2024-12-02 11:44:03,541 INFO L78 Accepts]: Start accepts. Automaton has 12849 states and 15196 transitions. Word has length 146 [2024-12-02 11:44:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:44:03,541 INFO L471 AbstractCegarLoop]: Abstraction has 12849 states and 15196 transitions. [2024-12-02 11:44:03,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 5.742857142857143) internal successors, (402), 70 states have internal predecessors, (402), 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 11:44:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 12849 states and 15196 transitions. [2024-12-02 11:44:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-02 11:44:03,544 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:44:03,544 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 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 11:44:03,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 11:44:03,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:44:03,744 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:44:03,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:44:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash -204358436, now seen corresponding path program 1 times [2024-12-02 11:44:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:44:03,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111368014] [2024-12-02 11:44:03,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:44:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:44:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:44:03,777 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:44:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:44:03,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:44:03,836 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:44:03,836 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 11:44:03,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 11:44:03,840 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] [2024-12-02 11:44:03,931 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:44:03,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:44:03 BoogieIcfgContainer [2024-12-02 11:44:03,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:44:03,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:44:03,933 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:44:03,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:44:03,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:33:47" (3/4) ... [2024-12-02 11:44:03,935 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 11:44:04,037 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 153. [2024-12-02 11:44:04,130 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 11:44:04,130 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 11:44:04,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:44:04,131 INFO L158 Benchmark]: Toolchain (without parser) took 617022.26ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 92.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 901.6MB. Max. memory is 16.1GB. [2024-12-02 11:44:04,131 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 70.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:44:04,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.03ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 78.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:44:04,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.50ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:44:04,132 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:44:04,132 INFO L158 Benchmark]: RCFGBuilder took 400.07ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 55.8MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:44:04,133 INFO L158 Benchmark]: TraceAbstraction took 616146.07ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 55.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 842.9MB. Max. memory is 16.1GB. [2024-12-02 11:44:04,133 INFO L158 Benchmark]: Witness Printer took 197.11ms. Allocated memory is still 2.6GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 11:44:04,134 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.20ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 70.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.03ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 78.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.50ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.07ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 55.8MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 616146.07ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 55.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 842.9MB. Max. memory is 16.1GB. * Witness Printer took 197.11ms. Allocated memory is still 2.6GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. 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: 282]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 ; [L27] port_t p1 ; [L28] char p1_old ; [L29] char p1_new ; [L30] char id1 ; [L31] char st1 ; [L32] msg_t send1 ; [L33] _Bool mode1 ; [L34] port_t p2 ; [L35] char p2_old ; [L36] char p2_new ; [L37] char id2 ; [L38] char st2 ; [L39] msg_t send2 ; [L40] _Bool mode2 ; [L41] port_t p3 ; [L42] char p3_old ; [L43] char p3_new ; [L44] char id3 ; [L45] char st3 ; [L46] msg_t send3 ; [L47] _Bool mode3 ; VAL [id1=0, id2=0, id3=0, 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] [L229] int c1 ; [L230] int i2 ; [L233] c1 = 0 [L234] r1 = __VERIFIER_nondet_char() [L235] id1 = __VERIFIER_nondet_char() [L236] st1 = __VERIFIER_nondet_char() [L237] send1 = __VERIFIER_nondet_char() [L238] mode1 = __VERIFIER_nondet_bool() [L239] id2 = __VERIFIER_nondet_char() [L240] st2 = __VERIFIER_nondet_char() [L241] send2 = __VERIFIER_nondet_char() [L242] mode2 = __VERIFIER_nondet_bool() [L243] id3 = __VERIFIER_nondet_char() [L244] st3 = __VERIFIER_nondet_char() [L245] send3 = __VERIFIER_nondet_char() [L246] mode3 = __VERIFIER_nondet_bool() [L247] CALL, EXPR init() [L128] int tmp ; VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L131] COND TRUE (int )r1 == 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L132] COND TRUE (int )id1 >= 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L133] COND TRUE (int )st1 == 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L134] COND TRUE (int )send1 == (int )id1 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L135] COND TRUE (int )mode1 == 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L136] COND TRUE (int )id2 >= 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L137] COND TRUE (int )st2 == 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L138] COND TRUE (int )send2 == (int )id2 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L139] COND TRUE (int )mode2 == 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L140] COND TRUE (int )id3 >= 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L141] COND TRUE (int )st3 == 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L142] COND TRUE (int )send3 == (int )id3 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L143] COND TRUE (int )mode3 == 0 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L144] COND TRUE (int )id1 != (int )id2 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L145] COND TRUE (int )id1 != (int )id3 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L146] COND TRUE (int )id2 != (int )id3 [L147] tmp = 1 VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0, tmp=1] [L196] return (tmp); VAL [\result=1, id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L247] RET, EXPR init() [L247] i2 = init() [L248] COND FALSE !(!(i2)) VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L249] p1_old = nomsg [L250] p1_new = nomsg [L251] p2_old = nomsg [L252] p2_new = nomsg [L253] p3_old = nomsg [L254] p3_new = nomsg [L255] i2 = 0 VAL [i2=0, id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 VAL [i2=0, id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=127, id2=1, id3=0, 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=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L54] COND FALSE !(\read(mode1)) [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=127, id2=1, id3=0, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L82] COND FALSE !(\read(mode2)) [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(mode3)) [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); VAL [\result=1, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [i2=1, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 VAL [i2=1, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg VAL [id1=127, id2=1, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L58] COND TRUE (int )m1 != (int )nomsg VAL [id1=127, id2=1, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L59] COND FALSE !((int )m1 > (int )id1) VAL [id1=127, id2=1, id3=0, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=0, st1=0, st2=0, st3=0] [L62] COND FALSE !((int )m1 == (int )id1) [L65] send1 = m1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=0, st1=0, st2=0, st3=0] [L68] mode1 = (_Bool)0 VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=0, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=0, st1=0, st2=0, st3=0] [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg VAL [id1=127, id2=1, id3=0, m2=127, mode1=0, mode2=1, 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=1, send3=0, st1=0, st2=0, st3=0] [L85] COND TRUE (int )m2 != (int )nomsg VAL [id1=127, id2=1, id3=0, m2=127, mode1=0, mode2=1, 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=1, send3=0, st1=0, st2=0, st3=0] [L86] COND TRUE (int )m2 > (int )id2 [L87] send2 = m2 VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, 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=127, send3=0, st1=0, st2=0, st3=0] [L93] mode2 = (_Bool)0 VAL [id1=127, id2=1, id3=0, 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=127, send3=0, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=127, id2=1, id3=0, 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=127, send3=0, st1=0, st2=0, st3=0] [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg VAL [id1=127, id2=1, id3=0, m3=1, 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=127, send3=0, st1=0, st2=0, st3=0] [L110] COND TRUE (int )m3 != (int )nomsg VAL [id1=127, id2=1, id3=0, m3=1, 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=127, send3=0, st1=0, st2=0, st3=0] [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L118] mode3 = (_Bool)0 VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); VAL [\result=1, id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [i2=2, id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 VAL [i2=2, id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L54] COND FALSE !(\read(mode1)) [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=127, id2=1, id3=0, 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=127, send3=1, st1=0, st2=0, st3=0] [L82] COND FALSE !(\read(mode2)) [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(mode3)) [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=1, p3_old=-1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); VAL [\result=1, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [i2=3, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 VAL [i2=3, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg VAL [id1=127, id2=1, id3=0, m1=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L58] COND TRUE (int )m1 != (int )nomsg VAL [id1=127, id2=1, id3=0, m1=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L59] COND FALSE !((int )m1 > (int )id1) VAL [id1=127, id2=1, id3=0, m1=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=127, send3=1, st1=0, st2=0, st3=0] [L62] COND FALSE !((int )m1 == (int )id1) [L65] send1 = m1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L68] mode1 = (_Bool)0 VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg VAL [id1=127, id2=1, id3=0, 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=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L85] COND TRUE (int )m2 != (int )nomsg VAL [id1=127, id2=1, id3=0, 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=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L86] COND FALSE !((int )m2 > (int )id2) VAL [id1=127, id2=1, id3=0, 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=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L89] COND FALSE !((int )m2 == (int )id2) VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L93] mode2 = (_Bool)0 VAL [id1=127, id2=1, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=127, id2=1, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg VAL [id1=127, id2=1, id3=0, m3=127, 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=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L110] COND TRUE (int )m3 != (int )nomsg VAL [id1=127, id2=1, id3=0, m3=127, 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=1, send2=127, send3=1, st1=0, st2=0, st3=0] [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L118] mode3 = (_Bool)0 VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); VAL [\result=1, id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [i2=4, id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 VAL [i2=4, id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L54] COND FALSE !(\read(mode1)) [L70] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L71] mode1 = (_Bool)1 VAL [id1=127, id2=1, id3=0, mode1=1, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=127, id2=1, id3=0, mode1=1, 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=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L82] COND FALSE !(\read(mode2)) [L95] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L96] mode2 = (_Bool)1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(mode3)) [L120] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L121] mode3 = (_Bool)1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L205] COND FALSE !((int )r1 >= 3) VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L208] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE (int )r1 < 3 [L211] tmp = 1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0, tmp=1] [L224] return (tmp); VAL [\result=1, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND FALSE !(! arg) VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L268] RET assert(c1) [L269] i2 ++ VAL [i2=5, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L256] COND TRUE i2 < 6 VAL [i2=5, id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L258] CALL node1() [L50] msg_t m1 ; [L53] m1 = nomsg VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L54] COND TRUE \read(mode1) [L55] r1 = (char )((int )r1 + 1) [L56] m1 = p3_old [L57] p3_old = nomsg VAL [id1=127, id2=1, id3=0, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L58] COND TRUE (int )m1 != (int )nomsg VAL [id1=127, id2=1, id3=0, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L59] COND FALSE !((int )m1 > (int )id1) VAL [id1=127, id2=1, id3=0, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=0, st2=0, st3=0] [L62] COND TRUE (int )m1 == (int )id1 [L63] st1 = (char)1 VAL [id1=127, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=0, st3=0] [L68] mode1 = (_Bool)0 VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=0, st3=0] [L258] RET node1() [L259] CALL node2() [L78] msg_t m2 ; [L81] m2 = nomsg VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=0, st3=0] [L82] COND TRUE \read(mode2) [L83] m2 = p1_old [L84] p1_old = nomsg VAL [id1=127, id2=1, id3=0, m2=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=0, st3=0] [L85] COND TRUE (int )m2 != (int )nomsg VAL [id1=127, id2=1, id3=0, m2=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=0, st3=0] [L86] COND FALSE !((int )m2 > (int )id2) VAL [id1=127, id2=1, id3=0, m2=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=0, st3=0] [L89] COND TRUE (int )m2 == (int )id2 [L90] st2 = (char)1 VAL [id1=127, id2=1, id3=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L93] mode2 = (_Bool)0 VAL [id1=127, id2=1, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L259] RET node2() [L260] CALL node3() [L103] msg_t m3 ; [L106] m3 = nomsg VAL [id1=127, id2=1, id3=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L107] COND TRUE \read(mode3) [L108] m3 = p2_old [L109] p2_old = nomsg VAL [id1=127, id2=1, id3=0, m3=127, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L110] COND TRUE (int )m3 != (int )nomsg VAL [id1=127, id2=1, id3=0, m3=127, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L111] COND TRUE (int )m3 > (int )id3 [L112] send3 = m3 VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L118] mode3 = (_Bool)0 VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L260] RET node3() [L261] p1_old = p1_new [L262] p1_new = nomsg [L263] p2_old = p2_new [L264] p2_new = nomsg [L265] p3_old = p3_new [L266] p3_new = nomsg [L267] CALL, EXPR check() [L201] int tmp ; VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L204] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L222] tmp = 0 VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0, tmp=0] [L224] return (tmp); VAL [\result=0, id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L267] RET, EXPR check() [L267] c1 = check() [L268] CALL assert(c1) [L280] COND TRUE ! arg VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0] [L282] reach_error() VAL [id1=127, id2=1, id3=0, 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=1, send2=127, send3=127, st1=1, st2=1, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 616.0s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 478.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40518 SdHoareTripleChecker+Valid, 36.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40518 mSDsluCounter, 50314 SdHoareTripleChecker+Invalid, 32.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47028 mSDsCounter, 1760 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44633 IncrementalHoareTripleChecker+Invalid, 46393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1760 mSolverCounterUnsat, 3286 mSDtfsCounter, 44633 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5340 GetRequests, 2792 SyntacticMatches, 6 SemanticMatches, 2542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179249 ImplicationChecksByTransitivity, 444.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18637occurred in iteration=28, InterpolantAutomatonStates: 1835, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 85619 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 109.2s InterpolantComputationTime, 4045 NumberOfCodeBlocks, 4045 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 5464 ConstructedInterpolants, 50 QuantifiedInterpolants, 138532 SizeOfPredicates, 117 NumberOfNonLiveVariables, 6395 ConjunctsInSsa, 565 ConjunctsInUnsatCore, 63 InterpolantComputations, 15 PerfectInterpolantSequences, 1593/4926 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 11:44:04,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_343235cd-3e8f-415f-859e-17c37a5d1da6/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE