./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_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/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_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:06:43,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:06:43,939 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 05:06:43,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:06:43,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:06:43,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:06:43,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:06:43,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:06:43,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:06:43,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:06:43,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:06:43,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:06:43,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:06:43,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:06:43,994 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:06:43,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:06:43,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:06:43,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:06:43,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:06:43,997 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:06:43,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:06:43,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:06:43,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:06:43,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:06:43,998 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:06:43,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:06:43,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:06:43,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:06:43,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:06:43,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:06:43,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:06:43,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:06:43,999 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_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2024-11-28 05:06:44,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:06:44,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:06:44,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:06:44,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:06:44,324 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:06:44,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-11-28 05:06:47,459 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/data/63a1c8b50/c05af3f3c4d84a06b12c6821d50430ca/FLAG4b556d9d3 [2024-11-28 05:06:47,777 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:06:47,779 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-11-28 05:06:47,791 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/data/63a1c8b50/c05af3f3c4d84a06b12c6821d50430ca/FLAG4b556d9d3 [2024-11-28 05:06:47,817 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/data/63a1c8b50/c05af3f3c4d84a06b12c6821d50430ca [2024-11-28 05:06:47,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:06:47,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:06:47,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:06:47,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:06:47,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:06:47,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:47" (1/1) ... [2024-11-28 05:06:47,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678e25b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:47, skipping insertion in model container [2024-11-28 05:06:47,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:47" (1/1) ... [2024-11-28 05:06:47,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:06:48,100 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_2e299af9-4db5-45f6-94cd-662d655cc083/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2024-11-28 05:06:48,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:06:48,118 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:06:48,178 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_2e299af9-4db5-45f6-94cd-662d655cc083/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2024-11-28 05:06:48,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:06:48,197 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:06:48,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48 WrapperNode [2024-11-28 05:06:48,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:06:48,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:06:48,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:06:48,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:06:48,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,243 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-11-28 05:06:48,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:06:48,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:06:48,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:06:48,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:06:48,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,280 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 05:06:48,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:06:48,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:06:48,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:06:48,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:06:48,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (1/1) ... [2024-11-28 05:06:48,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:06:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:48,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:06:48,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:06:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:06:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:06:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:06:48,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:06:48,462 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:06:48,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:06:48,830 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-28 05:06:48,831 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:06:48,843 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:06:48,843 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 05:06:48,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:48 BoogieIcfgContainer [2024-11-28 05:06:48,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:06:48,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:06:48,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:06:48,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:06:48,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:06:47" (1/3) ... [2024-11-28 05:06:48,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c59259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:48, skipping insertion in model container [2024-11-28 05:06:48,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:48" (2/3) ... [2024-11-28 05:06:48,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c59259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:48, skipping insertion in model container [2024-11-28 05:06:48,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:48" (3/3) ... [2024-11-28 05:06:48,855 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-11-28 05:06:48,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:06:48,875 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-11-28 05:06:48,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:06:48,951 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;@35267075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:06:48,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 05:06:48,957 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-11-28 05:06:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 05:06:48,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:48,966 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-11-28 05:06:48,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:48,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:48,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1016771987, now seen corresponding path program 1 times [2024-11-28 05:06:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592338765] [2024-11-28 05:06:48,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:49,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592338765] [2024-11-28 05:06:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592338765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:49,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:49,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:06:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536223784] [2024-11-28 05:06:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:06:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:49,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:06:49,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:06:49,205 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-11-28 05:06:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:49,222 INFO L93 Difference]: Finished difference Result 93 states and 148 transitions. [2024-11-28 05:06:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:06:49,224 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-11-28 05:06:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:49,233 INFO L225 Difference]: With dead ends: 93 [2024-11-28 05:06:49,234 INFO L226 Difference]: Without dead ends: 53 [2024-11-28 05:06:49,236 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-11-28 05:06:49,243 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-11-28 05:06:49,245 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-11-28 05:06:49,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-28 05:06:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-28 05:06:49,275 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-11-28 05:06:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2024-11-28 05:06:49,282 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 86 transitions. Word has length 20 [2024-11-28 05:06:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:49,282 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 86 transitions. [2024-11-28 05:06:49,283 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-11-28 05:06:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2024-11-28 05:06:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 05:06:49,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:49,284 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-11-28 05:06:49,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:06:49,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:49,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -263091691, now seen corresponding path program 1 times [2024-11-28 05:06:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:49,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142051381] [2024-11-28 05:06:49,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:49,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:49,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142051381] [2024-11-28 05:06:49,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142051381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:49,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:06:49,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530031645] [2024-11-28 05:06:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:49,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:49,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:49,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:49,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:49,583 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-11-28 05:06:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:49,688 INFO L93 Difference]: Finished difference Result 119 states and 186 transitions. [2024-11-28 05:06:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:06:49,689 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-11-28 05:06:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:49,690 INFO L225 Difference]: With dead ends: 119 [2024-11-28 05:06:49,693 INFO L226 Difference]: Without dead ends: 84 [2024-11-28 05:06:49,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:49,694 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 47 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-28 05:06:49,695 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-11-28 05:06:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-28 05:06:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2024-11-28 05:06:49,702 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-11-28 05:06:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2024-11-28 05:06:49,705 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 20 [2024-11-28 05:06:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:49,705 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2024-11-28 05:06:49,706 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-11-28 05:06:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2024-11-28 05:06:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 05:06:49,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:49,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:06:49,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:06:49,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -668548648, now seen corresponding path program 1 times [2024-11-28 05:06:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630714445] [2024-11-28 05:06:49,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630714445] [2024-11-28 05:06:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630714445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:49,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:49,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:06:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617076745] [2024-11-28 05:06:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:49,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:49,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:49,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:49,957 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-11-28 05:06:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:50,147 INFO L93 Difference]: Finished difference Result 239 states and 358 transitions. [2024-11-28 05:06:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:06:50,147 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-11-28 05:06:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:50,149 INFO L225 Difference]: With dead ends: 239 [2024-11-28 05:06:50,149 INFO L226 Difference]: Without dead ends: 208 [2024-11-28 05:06:50,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:06:50,151 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-11-28 05:06:50,151 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-11-28 05:06:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-28 05:06:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 82. [2024-11-28 05:06:50,162 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-11-28 05:06:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2024-11-28 05:06:50,163 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 35 [2024-11-28 05:06:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:50,163 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2024-11-28 05:06:50,164 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-11-28 05:06:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2024-11-28 05:06:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:06:50,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:50,165 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-11-28 05:06:50,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:06:50,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:50,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash 354142280, now seen corresponding path program 1 times [2024-11-28 05:06:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:50,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828821273] [2024-11-28 05:06:50,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:50,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:50,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828821273] [2024-11-28 05:06:50,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828821273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:50,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:50,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423988629] [2024-11-28 05:06:50,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:50,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:06:50,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:50,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:06:50,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:50,300 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-11-28 05:06:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:50,333 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2024-11-28 05:06:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:06:50,335 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-11-28 05:06:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:50,336 INFO L225 Difference]: With dead ends: 191 [2024-11-28 05:06:50,336 INFO L226 Difference]: Without dead ends: 131 [2024-11-28 05:06:50,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:50,337 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-11-28 05:06:50,338 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-11-28 05:06:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-28 05:06:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-28 05:06:50,353 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-11-28 05:06:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 185 transitions. [2024-11-28 05:06:50,355 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 185 transitions. Word has length 37 [2024-11-28 05:06:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:50,355 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 185 transitions. [2024-11-28 05:06:50,355 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-11-28 05:06:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 185 transitions. [2024-11-28 05:06:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:06:50,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:50,357 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-11-28 05:06:50,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:06:50,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:50,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash 420635792, now seen corresponding path program 1 times [2024-11-28 05:06:50,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:50,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827844968] [2024-11-28 05:06:50,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:50,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:50,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827844968] [2024-11-28 05:06:50,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827844968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:50,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:06:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017192406] [2024-11-28 05:06:50,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:50,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:50,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:50,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:50,650 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-11-28 05:06:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:50,758 INFO L93 Difference]: Finished difference Result 238 states and 349 transitions. [2024-11-28 05:06:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:06:50,759 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-11-28 05:06:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:50,760 INFO L225 Difference]: With dead ends: 238 [2024-11-28 05:06:50,761 INFO L226 Difference]: Without dead ends: 131 [2024-11-28 05:06:50,762 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-11-28 05:06:50,763 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:50,763 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.1s Time] [2024-11-28 05:06:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-28 05:06:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-28 05:06:50,783 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-11-28 05:06:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2024-11-28 05:06:50,784 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 37 [2024-11-28 05:06:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:50,785 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2024-11-28 05:06:50,785 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-11-28 05:06:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2024-11-28 05:06:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 05:06:50,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:50,786 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-11-28 05:06:50,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:06:50,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash -259915559, now seen corresponding path program 1 times [2024-11-28 05:06:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014762442] [2024-11-28 05:06:50,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:51,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:51,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014762442] [2024-11-28 05:06:51,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014762442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:51,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:51,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:06:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141838098] [2024-11-28 05:06:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:51,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:06:51,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:51,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:06:51,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:06:51,178 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-11-28 05:06:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:51,251 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2024-11-28 05:06:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:06:51,252 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-11-28 05:06:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:51,254 INFO L225 Difference]: With dead ends: 137 [2024-11-28 05:06:51,254 INFO L226 Difference]: Without dead ends: 135 [2024-11-28 05:06:51,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:06:51,255 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:51,255 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.1s Time] [2024-11-28 05:06:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-28 05:06:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-28 05:06:51,274 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-11-28 05:06:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 188 transitions. [2024-11-28 05:06:51,278 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 188 transitions. Word has length 38 [2024-11-28 05:06:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:51,279 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 188 transitions. [2024-11-28 05:06:51,279 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-11-28 05:06:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 188 transitions. [2024-11-28 05:06:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 05:06:51,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:51,280 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-11-28 05:06:51,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:06:51,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:51,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1886850160, now seen corresponding path program 1 times [2024-11-28 05:06:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:51,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279644492] [2024-11-28 05:06:51,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:51,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279644492] [2024-11-28 05:06:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279644492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054206838] [2024-11-28 05:06:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:51,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:06:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:51,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:06:51,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:51,366 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-11-28 05:06:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:51,388 INFO L93 Difference]: Finished difference Result 262 states and 374 transitions. [2024-11-28 05:06:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:06:51,389 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-11-28 05:06:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:51,392 INFO L225 Difference]: With dead ends: 262 [2024-11-28 05:06:51,393 INFO L226 Difference]: Without dead ends: 196 [2024-11-28 05:06:51,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:51,395 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-11-28 05:06:51,396 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-11-28 05:06:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-28 05:06:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2024-11-28 05:06:51,410 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-11-28 05:06:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2024-11-28 05:06:51,419 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 39 [2024-11-28 05:06:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:51,420 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2024-11-28 05:06:51,420 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-11-28 05:06:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2024-11-28 05:06:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 05:06:51,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:51,421 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-11-28 05:06:51,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:06:51,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:51,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash 192648336, now seen corresponding path program 1 times [2024-11-28 05:06:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:51,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174806223] [2024-11-28 05:06:51,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:51,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:51,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:51,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174806223] [2024-11-28 05:06:51,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174806223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:51,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:51,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276433648] [2024-11-28 05:06:51,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:51,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:06:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:06:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:51,512 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-11-28 05:06:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:51,543 INFO L93 Difference]: Finished difference Result 508 states and 724 transitions. [2024-11-28 05:06:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:06:51,544 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-11-28 05:06:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:51,545 INFO L225 Difference]: With dead ends: 508 [2024-11-28 05:06:51,546 INFO L226 Difference]: Without dead ends: 339 [2024-11-28 05:06:51,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:51,548 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-11-28 05:06:51,550 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-11-28 05:06:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-28 05:06:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2024-11-28 05:06:51,573 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-11-28 05:06:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 470 transitions. [2024-11-28 05:06:51,575 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 470 transitions. Word has length 39 [2024-11-28 05:06:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:51,575 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 470 transitions. [2024-11-28 05:06:51,575 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-11-28 05:06:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 470 transitions. [2024-11-28 05:06:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 05:06:51,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:51,580 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-11-28 05:06:51,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:06:51,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:51,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1973581200, now seen corresponding path program 1 times [2024-11-28 05:06:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818814927] [2024-11-28 05:06:51,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:51,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818814927] [2024-11-28 05:06:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818814927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:51,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536330598] [2024-11-28 05:06:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:06:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:51,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:06:51,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:51,655 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-11-28 05:06:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:51,697 INFO L93 Difference]: Finished difference Result 913 states and 1276 transitions. [2024-11-28 05:06:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:06:51,698 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-11-28 05:06:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:51,705 INFO L225 Difference]: With dead ends: 913 [2024-11-28 05:06:51,705 INFO L226 Difference]: Without dead ends: 601 [2024-11-28 05:06:51,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:51,710 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-11-28 05:06:51,711 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-11-28 05:06:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-28 05:06:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2024-11-28 05:06:51,738 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-11-28 05:06:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 818 transitions. [2024-11-28 05:06:51,742 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 818 transitions. Word has length 39 [2024-11-28 05:06:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 818 transitions. [2024-11-28 05:06:51,742 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-11-28 05:06:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 818 transitions. [2024-11-28 05:06:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:06:51,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:51,744 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-11-28 05:06:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:06:51,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:51,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2108144598, now seen corresponding path program 1 times [2024-11-28 05:06:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547850637] [2024-11-28 05:06:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 05:06:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547850637] [2024-11-28 05:06:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547850637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:51,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:51,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:06:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751476499] [2024-11-28 05:06:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:51,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:51,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:51,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:51,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:51,943 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-11-28 05:06:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:52,109 INFO L93 Difference]: Finished difference Result 2299 states and 3162 transitions. [2024-11-28 05:06:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:06:52,110 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-11-28 05:06:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:52,119 INFO L225 Difference]: With dead ends: 2299 [2024-11-28 05:06:52,120 INFO L226 Difference]: Without dead ends: 1881 [2024-11-28 05:06:52,121 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-11-28 05:06:52,122 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 164 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:52,122 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.1s Time] [2024-11-28 05:06:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2024-11-28 05:06:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1095. [2024-11-28 05:06:52,210 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-11-28 05:06:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1494 transitions. [2024-11-28 05:06:52,223 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1494 transitions. Word has length 55 [2024-11-28 05:06:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:52,223 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1494 transitions. [2024-11-28 05:06:52,223 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-11-28 05:06:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1494 transitions. [2024-11-28 05:06:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:06:52,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:52,226 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-11-28 05:06:52,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:06:52,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash -107324202, now seen corresponding path program 1 times [2024-11-28 05:06:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454803623] [2024-11-28 05:06:52,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 05:06:52,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:52,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454803623] [2024-11-28 05:06:52,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454803623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:52,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:06:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958703572] [2024-11-28 05:06:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:52,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:52,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:52,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:52,443 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-11-28 05:06:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:52,626 INFO L93 Difference]: Finished difference Result 2871 states and 3946 transitions. [2024-11-28 05:06:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:06:52,626 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-11-28 05:06:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:52,636 INFO L225 Difference]: With dead ends: 2871 [2024-11-28 05:06:52,636 INFO L226 Difference]: Without dead ends: 2297 [2024-11-28 05:06:52,637 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-11-28 05:06:52,638 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 164 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:52,638 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.1s Time] [2024-11-28 05:06:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-11-28 05:06:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1875. [2024-11-28 05:06:52,743 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-11-28 05:06:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2554 transitions. [2024-11-28 05:06:52,754 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2554 transitions. Word has length 55 [2024-11-28 05:06:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:52,754 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2554 transitions. [2024-11-28 05:06:52,755 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-11-28 05:06:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2554 transitions. [2024-11-28 05:06:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:06:52,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:52,756 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-11-28 05:06:52,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:06:52,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:52,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:52,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1673608662, now seen corresponding path program 1 times [2024-11-28 05:06:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122099591] [2024-11-28 05:06:52,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 05:06:52,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122099591] [2024-11-28 05:06:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122099591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:52,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:52,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:06:52,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079546182] [2024-11-28 05:06:52,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:52,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:52,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:52,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:52,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:52,953 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-11-28 05:06:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:53,189 INFO L93 Difference]: Finished difference Result 3443 states and 4726 transitions. [2024-11-28 05:06:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:06:53,189 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-11-28 05:06:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:53,202 INFO L225 Difference]: With dead ends: 3443 [2024-11-28 05:06:53,202 INFO L226 Difference]: Without dead ends: 2869 [2024-11-28 05:06:53,207 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-11-28 05:06:53,208 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 170 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:53,208 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.1s Time] [2024-11-28 05:06:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2024-11-28 05:06:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2447. [2024-11-28 05:06:53,336 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-11-28 05:06:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3334 transitions. [2024-11-28 05:06:53,369 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3334 transitions. Word has length 55 [2024-11-28 05:06:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:53,370 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3334 transitions. [2024-11-28 05:06:53,370 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-11-28 05:06:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3334 transitions. [2024-11-28 05:06:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-28 05:06:53,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:53,371 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-11-28 05:06:53,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:06:53,372 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:53,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash 919127620, now seen corresponding path program 1 times [2024-11-28 05:06:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:53,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041905736] [2024-11-28 05:06:53,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:53,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041905736] [2024-11-28 05:06:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041905736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:53,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:53,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236608302] [2024-11-28 05:06:53,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:53,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:06:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:53,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:06:53,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:53,504 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-11-28 05:06:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:53,602 INFO L93 Difference]: Finished difference Result 4871 states and 6644 transitions. [2024-11-28 05:06:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:06:53,603 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-11-28 05:06:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:53,612 INFO L225 Difference]: With dead ends: 4871 [2024-11-28 05:06:53,612 INFO L226 Difference]: Without dead ends: 2449 [2024-11-28 05:06:53,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:53,615 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-11-28 05:06:53,616 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-11-28 05:06:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2024-11-28 05:06:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2447. [2024-11-28 05:06:53,738 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-11-28 05:06:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3284 transitions. [2024-11-28 05:06:53,749 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3284 transitions. Word has length 56 [2024-11-28 05:06:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3284 transitions. [2024-11-28 05:06:53,750 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-11-28 05:06:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3284 transitions. [2024-11-28 05:06:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-28 05:06:53,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:53,755 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-11-28 05:06:53,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:06:53,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:53,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1408550898, now seen corresponding path program 1 times [2024-11-28 05:06:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:53,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539383234] [2024-11-28 05:06:53,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:53,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539383234] [2024-11-28 05:06:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539383234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472964508] [2024-11-28 05:06:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:53,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:06:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:53,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:06:53,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:53,891 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-11-28 05:06:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:53,943 INFO L93 Difference]: Finished difference Result 3403 states and 4581 transitions. [2024-11-28 05:06:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:06:53,944 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-11-28 05:06:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:53,948 INFO L225 Difference]: With dead ends: 3403 [2024-11-28 05:06:53,948 INFO L226 Difference]: Without dead ends: 981 [2024-11-28 05:06:53,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:53,952 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-11-28 05:06:53,952 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-11-28 05:06:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-28 05:06:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 972. [2024-11-28 05:06:53,992 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-11-28 05:06:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1295 transitions. [2024-11-28 05:06:53,998 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1295 transitions. Word has length 57 [2024-11-28 05:06:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:53,999 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1295 transitions. [2024-11-28 05:06:53,999 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-11-28 05:06:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1295 transitions. [2024-11-28 05:06:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 05:06:54,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:54,004 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-11-28 05:06:54,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:06:54,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:54,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1062832502, now seen corresponding path program 1 times [2024-11-28 05:06:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:54,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833916126] [2024-11-28 05:06:54,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:54,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:54,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:54,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833916126] [2024-11-28 05:06:54,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833916126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:54,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:54,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015975268] [2024-11-28 05:06:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:54,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:06:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:54,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:06:54,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:54,125 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-11-28 05:06:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:54,163 INFO L93 Difference]: Finished difference Result 1444 states and 1927 transitions. [2024-11-28 05:06:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:06:54,163 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-11-28 05:06:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:54,166 INFO L225 Difference]: With dead ends: 1444 [2024-11-28 05:06:54,166 INFO L226 Difference]: Without dead ends: 506 [2024-11-28 05:06:54,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:54,168 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-11-28 05:06:54,168 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-11-28 05:06:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-28 05:06:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2024-11-28 05:06:54,190 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-11-28 05:06:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 656 transitions. [2024-11-28 05:06:54,193 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 656 transitions. Word has length 58 [2024-11-28 05:06:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:54,193 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 656 transitions. [2024-11-28 05:06:54,193 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-11-28 05:06:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 656 transitions. [2024-11-28 05:06:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 05:06:54,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:54,195 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-11-28 05:06:54,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:06:54,195 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:54,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -207437016, now seen corresponding path program 1 times [2024-11-28 05:06:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:54,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360270194] [2024-11-28 05:06:54,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:54,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:54,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360270194] [2024-11-28 05:06:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360270194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:54,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651128991] [2024-11-28 05:06:54,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:54,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:54,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:54,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:54,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:06:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:55,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 05:06:55,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 05:06:55,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:06:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 05:06:55,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651128991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:06:55,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:06:55,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2024-11-28 05:06:55,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197476050] [2024-11-28 05:06:55,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:55,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:06:55,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:55,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:06:55,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:06:55,865 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-11-28 05:06:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:57,456 INFO L93 Difference]: Finished difference Result 2617 states and 3382 transitions. [2024-11-28 05:06:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 05:06:57,457 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-11-28 05:06:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:57,465 INFO L225 Difference]: With dead ends: 2617 [2024-11-28 05:06:57,465 INFO L226 Difference]: Without dead ends: 2147 [2024-11-28 05:06:57,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=373, Invalid=1349, Unknown=0, NotChecked=0, Total=1722 [2024-11-28 05:06:57,468 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 1133 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:57,468 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.5s Time] [2024-11-28 05:06:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2024-11-28 05:06:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2011. [2024-11-28 05:06:57,574 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-11-28 05:06:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2506 transitions. [2024-11-28 05:06:57,583 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2506 transitions. Word has length 60 [2024-11-28 05:06:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:57,584 INFO L471 AbstractCegarLoop]: Abstraction has 2011 states and 2506 transitions. [2024-11-28 05:06:57,584 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-11-28 05:06:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2506 transitions. [2024-11-28 05:06:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-28 05:06:57,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:57,585 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-11-28 05:06:57,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:06:57,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 05:06:57,790 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:06:57,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1137688292, now seen corresponding path program 1 times [2024-11-28 05:06:57,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:57,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710744543] [2024-11-28 05:06:57,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:57,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:58,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:58,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710744543] [2024-11-28 05:06:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710744543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:58,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828557398] [2024-11-28 05:06:58,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:58,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:58,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:58,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:58,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:06:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:58,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-28 05:06:58,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:59,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828557398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:07:00,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:07:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-28 05:07:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322098845] [2024-11-28 05:07:00,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:00,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 05:07:00,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:00,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 05:07:00,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2024-11-28 05:07:00,969 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-11-28 05:07:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:05,712 INFO L93 Difference]: Finished difference Result 7205 states and 8974 transitions. [2024-11-28 05:07:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-28 05:07:05,713 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-11-28 05:07:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:05,733 INFO L225 Difference]: With dead ends: 7205 [2024-11-28 05:07:05,733 INFO L226 Difference]: Without dead ends: 5406 [2024-11-28 05:07:05,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=934, Invalid=3896, Unknown=0, NotChecked=0, Total=4830 [2024-11-28 05:07:05,739 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1277 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:05,739 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.8s Time] [2024-11-28 05:07:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2024-11-28 05:07:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 4614. [2024-11-28 05:07:05,994 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-11-28 05:07:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 5626 transitions. [2024-11-28 05:07:06,012 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 5626 transitions. Word has length 61 [2024-11-28 05:07:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:06,013 INFO L471 AbstractCegarLoop]: Abstraction has 4614 states and 5626 transitions. [2024-11-28 05:07:06,013 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-11-28 05:07:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5626 transitions. [2024-11-28 05:07:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 05:07:06,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:06,015 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-11-28 05:07:06,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:07:06,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 05:07:06,215 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:07:06,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash 580574178, now seen corresponding path program 1 times [2024-11-28 05:07:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266359436] [2024-11-28 05:07:06,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:07,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266359436] [2024-11-28 05:07:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266359436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455772567] [2024-11-28 05:07:07,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:07,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:07,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:07,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:07,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:07:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:08,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 05:07:08,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:10,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:14,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455772567] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:07:14,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:07:14,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 50 [2024-11-28 05:07:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461043399] [2024-11-28 05:07:14,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:14,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 05:07:14,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:14,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 05:07:14,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2241, Unknown=0, NotChecked=0, Total=2450 [2024-11-28 05:07:14,640 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-11-28 05:08:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:12,095 INFO L93 Difference]: Finished difference Result 15589 states and 19101 transitions. [2024-11-28 05:08:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2024-11-28 05:08:12,095 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-11-28 05:08:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:12,124 INFO L225 Difference]: With dead ends: 15589 [2024-11-28 05:08:12,125 INFO L226 Difference]: Without dead ends: 11556 [2024-11-28 05:08:12,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20491 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=9218, Invalid=45304, Unknown=0, NotChecked=0, Total=54522 [2024-11-28 05:08:12,142 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 4464 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 4076 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:12,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4464 Valid, 3466 Invalid, 4230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 4076 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-28 05:08:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2024-11-28 05:08:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 3148. [2024-11-28 05:08:12,446 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-11-28 05:08:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3847 transitions. [2024-11-28 05:08:12,455 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3847 transitions. Word has length 62 [2024-11-28 05:08:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:12,456 INFO L471 AbstractCegarLoop]: Abstraction has 3148 states and 3847 transitions. [2024-11-28 05:08:12,456 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-11-28 05:08:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3847 transitions. [2024-11-28 05:08:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 05:08:12,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:12,458 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-11-28 05:08:12,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:08:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 05:08:12,663 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:08:12,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1448215816, now seen corresponding path program 1 times [2024-11-28 05:08:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570730001] [2024-11-28 05:08:12,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 39 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:14,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570730001] [2024-11-28 05:08:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570730001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:14,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648323126] [2024-11-28 05:08:14,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:14,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:14,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:14,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:14,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:08:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:14,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 05:08:14,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:16,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:20,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648323126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:20,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:20,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 49 [2024-11-28 05:08:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569363102] [2024-11-28 05:08:20,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:20,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-28 05:08:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:20,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-28 05:08:20,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2146, Unknown=0, NotChecked=0, Total=2352 [2024-11-28 05:08:20,611 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-11-28 05:08:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:46,337 INFO L93 Difference]: Finished difference Result 7119 states and 8709 transitions. [2024-11-28 05:08:46,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-11-28 05:08:46,338 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-11-28 05:08:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:46,352 INFO L225 Difference]: With dead ends: 7119 [2024-11-28 05:08:46,353 INFO L226 Difference]: Without dead ends: 5935 [2024-11-28 05:08:46,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8047 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=4106, Invalid=21654, Unknown=0, NotChecked=0, Total=25760 [2024-11-28 05:08:46,358 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 2733 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:46,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 2359 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 05:08:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5935 states. [2024-11-28 05:08:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5935 to 2507. [2024-11-28 05:08:46,619 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-11-28 05:08:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3007 transitions. [2024-11-28 05:08:46,626 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3007 transitions. Word has length 103 [2024-11-28 05:08:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:46,626 INFO L471 AbstractCegarLoop]: Abstraction has 2507 states and 3007 transitions. [2024-11-28 05:08:46,627 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-11-28 05:08:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3007 transitions. [2024-11-28 05:08:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 05:08:46,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:46,629 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-11-28 05:08:46,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 05:08:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:46,833 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:08:46,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1151916394, now seen corresponding path program 1 times [2024-11-28 05:08:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:46,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463442063] [2024-11-28 05:08:46,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 26 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:47,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:47,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463442063] [2024-11-28 05:08:47,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463442063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:47,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979552690] [2024-11-28 05:08:47,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:47,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:47,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:47,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:47,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:08:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:48,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-28 05:08:48,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:49,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979552690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:51,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:51,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 37 [2024-11-28 05:08:51,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99819238] [2024-11-28 05:08:51,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:51,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-28 05:08:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:51,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-28 05:08:51,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2024-11-28 05:08:51,857 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-11-28 05:09:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:00,983 INFO L93 Difference]: Finished difference Result 16303 states and 19704 transitions. [2024-11-28 05:09:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-28 05:09:00,984 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-11-28 05:09:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:01,014 INFO L225 Difference]: With dead ends: 16303 [2024-11-28 05:09:01,014 INFO L226 Difference]: Without dead ends: 14270 [2024-11-28 05:09:01,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2096, Invalid=9894, Unknown=0, NotChecked=0, Total=11990 [2024-11-28 05:09:01,020 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1631 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:01,020 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.6s Time] [2024-11-28 05:09:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14270 states. [2024-11-28 05:09:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14270 to 10906. [2024-11-28 05:09:02,059 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-11-28 05:09:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10906 states to 10906 states and 13089 transitions. [2024-11-28 05:09:02,086 INFO L78 Accepts]: Start accepts. Automaton has 10906 states and 13089 transitions. Word has length 103 [2024-11-28 05:09:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:02,086 INFO L471 AbstractCegarLoop]: Abstraction has 10906 states and 13089 transitions. [2024-11-28 05:09:02,086 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-11-28 05:09:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 10906 states and 13089 transitions. [2024-11-28 05:09:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 05:09:02,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:02,089 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-11-28 05:09:02,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:09:02,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:02,290 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:09:02,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2069183626, now seen corresponding path program 1 times [2024-11-28 05:09:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:09:02,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748086517] [2024-11-28 05:09:02,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:02,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:09:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748086517] [2024-11-28 05:09:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748086517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861731834] [2024-11-28 05:09:03,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:03,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:03,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:03,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:03,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:09:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:03,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 05:09:03,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:04,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861731834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:09:06,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:09:06,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2024-11-28 05:09:06,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702132174] [2024-11-28 05:09:06,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:09:06,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 05:09:06,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:09:06,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 05:09:06,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-28 05:09:06,085 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-11-28 05:09:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:10,502 INFO L93 Difference]: Finished difference Result 23942 states and 28761 transitions. [2024-11-28 05:09:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 05:09:10,503 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-11-28 05:09:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:10,536 INFO L225 Difference]: With dead ends: 23942 [2024-11-28 05:09:10,536 INFO L226 Difference]: Without dead ends: 13650 [2024-11-28 05:09:10,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=673, Invalid=2749, Unknown=0, NotChecked=0, Total=3422 [2024-11-28 05:09:10,545 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 962 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:10,546 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.7s Time] [2024-11-28 05:09:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13650 states. [2024-11-28 05:09:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13650 to 7389. [2024-11-28 05:09:11,372 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-11-28 05:09:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 8839 transitions. [2024-11-28 05:09:11,385 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 8839 transitions. Word has length 104 [2024-11-28 05:09:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:11,385 INFO L471 AbstractCegarLoop]: Abstraction has 7389 states and 8839 transitions. [2024-11-28 05:09:11,386 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-11-28 05:09:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 8839 transitions. [2024-11-28 05:09:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 05:09:11,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:11,389 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-11-28 05:09:11,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:09:11,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 05:09:11,590 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:09:11,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 879843668, now seen corresponding path program 1 times [2024-11-28 05:09:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:09:11,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398985586] [2024-11-28 05:09:11,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:09:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398985586] [2024-11-28 05:09:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398985586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645154954] [2024-11-28 05:09:14,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:14,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:14,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:14,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:14,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:09:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:14,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 05:09:14,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 34 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:18,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 25 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645154954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:09:30,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:09:30,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 28] total 81 [2024-11-28 05:09:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802701346] [2024-11-28 05:09:30,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:09:30,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-11-28 05:09:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:09:30,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-11-28 05:09:30,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=6005, Unknown=0, NotChecked=0, Total=6480 [2024-11-28 05:09:30,949 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-11-28 05:11:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:55,355 INFO L93 Difference]: Finished difference Result 21638 states and 26081 transitions. [2024-11-28 05:11:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-28 05:11:55,356 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-11-28 05:11:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:55,388 INFO L225 Difference]: With dead ends: 21638 [2024-11-28 05:11:55,389 INFO L226 Difference]: Without dead ends: 15279 [2024-11-28 05:11:55,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23702 ImplicationChecksByTransitivity, 142.9s TimeCoverageRelationStatistics Valid=11239, Invalid=63563, Unknown=0, NotChecked=0, Total=74802 [2024-11-28 05:11:55,403 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 4171 mSDsluCounter, 6685 mSDsCounter, 0 mSdLazyCounter, 5549 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s 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, 7.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:55,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4171 Valid, 6884 Invalid, 5828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 5549 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-28 05:11:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15279 states. [2024-11-28 05:11:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15279 to 9860. [2024-11-28 05:11:56,657 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-11-28 05:11:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 11820 transitions. [2024-11-28 05:11:56,673 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 11820 transitions. Word has length 104 [2024-11-28 05:11:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:56,674 INFO L471 AbstractCegarLoop]: Abstraction has 9860 states and 11820 transitions. [2024-11-28 05:11:56,674 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-11-28 05:11:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 11820 transitions. [2024-11-28 05:11:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 05:11:56,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:56,677 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-11-28 05:11:56,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:11:56,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 05:11:56,879 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:11:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2107819364, now seen corresponding path program 1 times [2024-11-28 05:11:56,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:56,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122011628] [2024-11-28 05:11:56,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:59,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122011628] [2024-11-28 05:11:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122011628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285629923] [2024-11-28 05:11:59,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:11:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:11:59,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:11:59,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:11:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:59,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 05:11:59,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:03,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285629923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:12:11,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:12:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 20] total 63 [2024-11-28 05:12:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848948839] [2024-11-28 05:12:11,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-28 05:12:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:11,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-28 05:12:11,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=3600, Unknown=0, NotChecked=0, Total=3906 [2024-11-28 05:12:11,595 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-11-28 05:12:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:29,821 INFO L93 Difference]: Finished difference Result 12193 states and 14648 transitions. [2024-11-28 05:12:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-28 05:12:29,821 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-11-28 05:12:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:29,840 INFO L225 Difference]: With dead ends: 12193 [2024-11-28 05:12:29,840 INFO L226 Difference]: Without dead ends: 9965 [2024-11-28 05:12:29,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2588 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=1707, Invalid=10283, Unknown=0, NotChecked=0, Total=11990 [2024-11-28 05:12:29,845 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1378 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:29,845 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.8s Time] [2024-11-28 05:12:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2024-11-28 05:12:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 9870. [2024-11-28 05:12:31,132 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-11-28 05:12:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9870 states to 9870 states and 11831 transitions. [2024-11-28 05:12:31,146 INFO L78 Accepts]: Start accepts. Automaton has 9870 states and 11831 transitions. Word has length 104 [2024-11-28 05:12:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 9870 states and 11831 transitions. [2024-11-28 05:12:31,147 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-11-28 05:12:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 9870 states and 11831 transitions. [2024-11-28 05:12:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 05:12:31,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:31,149 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-11-28 05:12:31,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:12:31,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 05:12:31,351 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:12:31,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -964567968, now seen corresponding path program 1 times [2024-11-28 05:12:31,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369978033] [2024-11-28 05:12:31,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:32,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369978033] [2024-11-28 05:12:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369978033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032670041] [2024-11-28 05:12:32,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:32,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:32,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:32,447 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:32,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:12:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:32,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 05:12:32,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:34,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032670041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:12:36,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:12:36,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 39 [2024-11-28 05:12:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211745971] [2024-11-28 05:12:36,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-28 05:12:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:36,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-28 05:12:36,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2024-11-28 05:12:36,236 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-11-28 05:12:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:43,296 INFO L93 Difference]: Finished difference Result 24179 states and 29113 transitions. [2024-11-28 05:12:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-28 05:12:43,297 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-11-28 05:12:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:43,326 INFO L225 Difference]: With dead ends: 24179 [2024-11-28 05:12:43,326 INFO L226 Difference]: Without dead ends: 16340 [2024-11-28 05:12:43,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1629, Invalid=9501, Unknown=0, NotChecked=0, Total=11130 [2024-11-28 05:12:43,336 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1566 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:43,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 1789 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 05:12:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16340 states. [2024-11-28 05:12:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16340 to 13365. [2024-11-28 05:12:45,181 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-11-28 05:12:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13365 states to 13365 states and 15881 transitions. [2024-11-28 05:12:45,195 INFO L78 Accepts]: Start accepts. Automaton has 13365 states and 15881 transitions. Word has length 105 [2024-11-28 05:12:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:45,195 INFO L471 AbstractCegarLoop]: Abstraction has 13365 states and 15881 transitions. [2024-11-28 05:12:45,195 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-11-28 05:12:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 13365 states and 15881 transitions. [2024-11-28 05:12:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 05:12:45,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:45,198 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-11-28 05:12:45,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 05:12:45,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 05:12:45,399 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:12:45,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1399271496, now seen corresponding path program 1 times [2024-11-28 05:12:45,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:45,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526036908] [2024-11-28 05:12:45,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:47,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:47,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526036908] [2024-11-28 05:12:47,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526036908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95002563] [2024-11-28 05:12:47,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:47,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:47,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:47,394 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:47,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:12:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:47,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-28 05:12:47,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:52,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-11-28 05:12:52,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95002563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:12:58,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:12:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 19] total 65 [2024-11-28 05:12:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460743890] [2024-11-28 05:12:58,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:58,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-28 05:12:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:58,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-28 05:12:58,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=3853, Unknown=0, NotChecked=0, Total=4160 [2024-11-28 05:12:58,059 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-11-28 05:15:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:00,513 INFO L93 Difference]: Finished difference Result 38303 states and 45443 transitions. [2024-11-28 05:15:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2024-11-28 05:15:00,513 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-11-28 05:15:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:00,544 INFO L225 Difference]: With dead ends: 38303 [2024-11-28 05:15:00,544 INFO L226 Difference]: Without dead ends: 30799 [2024-11-28 05:15:00,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44931 ImplicationChecksByTransitivity, 115.6s TimeCoverageRelationStatistics Valid=15532, Invalid=99728, Unknown=0, NotChecked=0, Total=115260 [2024-11-28 05:15:00,559 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 5953 mSDsluCounter, 5532 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s 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, 6.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:00,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5953 Valid, 5708 Invalid, 4709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-28 05:15:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30799 states. [2024-11-28 05:15:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30799 to 15880. [2024-11-28 05:15:02,864 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-11-28 05:15:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15880 states to 15880 states and 18835 transitions. [2024-11-28 05:15:02,880 INFO L78 Accepts]: Start accepts. Automaton has 15880 states and 18835 transitions. Word has length 105 [2024-11-28 05:15:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:02,880 INFO L471 AbstractCegarLoop]: Abstraction has 15880 states and 18835 transitions. [2024-11-28 05:15:02,881 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-11-28 05:15:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 15880 states and 18835 transitions. [2024-11-28 05:15:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 05:15:02,883 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:02,883 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-11-28 05:15:02,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:15:03,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 05:15:03,084 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:15:03,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1622892984, now seen corresponding path program 1 times [2024-11-28 05:15:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:03,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142490149] [2024-11-28 05:15:03,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:03,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 26 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:04,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142490149] [2024-11-28 05:15:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142490149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879428814] [2024-11-28 05:15:04,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:04,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:04,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:04,914 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:04,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:15:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:05,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 05:15:05,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 26 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:07,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879428814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:15:15,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:15:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 64 [2024-11-28 05:15:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124841885] [2024-11-28 05:15:15,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:15:15,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-28 05:15:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:15:15,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-28 05:15:15,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=3725, Unknown=0, NotChecked=0, Total=4032 [2024-11-28 05:15:15,742 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-11-28 05:16:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:46,577 INFO L93 Difference]: Finished difference Result 42237 states and 50658 transitions. [2024-11-28 05:16:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2024-11-28 05:16:46,577 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-11-28 05:16:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:46,602 INFO L225 Difference]: With dead ends: 42237 [2024-11-28 05:16:46,602 INFO L226 Difference]: Without dead ends: 30647 [2024-11-28 05:16:46,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33766 ImplicationChecksByTransitivity, 84.2s TimeCoverageRelationStatistics Valid=15887, Invalid=73813, Unknown=0, NotChecked=0, Total=89700 [2024-11-28 05:16:46,614 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 4371 mSDsluCounter, 4528 mSDsCounter, 0 mSdLazyCounter, 4781 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:46,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4371 Valid, 4675 Invalid, 4965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 4781 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-28 05:16:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30647 states. [2024-11-28 05:16:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30647 to 17717. [2024-11-28 05:16:49,498 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-11-28 05:16:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17717 states to 17717 states and 21100 transitions. [2024-11-28 05:16:49,517 INFO L78 Accepts]: Start accepts. Automaton has 17717 states and 21100 transitions. Word has length 106 [2024-11-28 05:16:49,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:49,518 INFO L471 AbstractCegarLoop]: Abstraction has 17717 states and 21100 transitions. [2024-11-28 05:16:49,518 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-11-28 05:16:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 17717 states and 21100 transitions. [2024-11-28 05:16:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 05:16:49,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:49,520 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-11-28 05:16:49,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:16:49,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 05:16:49,721 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:16:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash -137206902, now seen corresponding path program 1 times [2024-11-28 05:16:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388834450] [2024-11-28 05:16:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:16:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388834450] [2024-11-28 05:16:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388834450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071826577] [2024-11-28 05:16:51,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:51,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:51,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:51,478 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:16:51,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:16:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:51,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 05:16:51,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:16:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:16:55,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:17:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071826577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:17:07,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:17:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29, 28] total 74 [2024-11-28 05:17:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361671905] [2024-11-28 05:17:07,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:17:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-28 05:17:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:07,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-28 05:17:07,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=4755, Unknown=0, NotChecked=0, Total=5402 [2024-11-28 05:17:07,240 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-11-28 05:18:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:24,849 INFO L93 Difference]: Finished difference Result 35511 states and 42290 transitions. [2024-11-28 05:18:24,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-11-28 05:18:24,849 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-11-28 05:18:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:24,871 INFO L225 Difference]: With dead ends: 35511 [2024-11-28 05:18:24,871 INFO L226 Difference]: Without dead ends: 28433 [2024-11-28 05:18:24,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18168 ImplicationChecksByTransitivity, 74.0s TimeCoverageRelationStatistics Valid=11022, Invalid=40734, Unknown=0, NotChecked=0, Total=51756 [2024-11-28 05:18:24,880 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 3182 mSDsluCounter, 4451 mSDsCounter, 0 mSdLazyCounter, 4556 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 5.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:24,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3182 Valid, 4625 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 4556 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-28 05:18:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28433 states. [2024-11-28 05:18:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28433 to 18604. [2024-11-28 05:18:27,887 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-11-28 05:18:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18604 states to 18604 states and 22168 transitions. [2024-11-28 05:18:27,908 INFO L78 Accepts]: Start accepts. Automaton has 18604 states and 22168 transitions. Word has length 106 [2024-11-28 05:18:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:27,908 INFO L471 AbstractCegarLoop]: Abstraction has 18604 states and 22168 transitions. [2024-11-28 05:18:27,908 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-11-28 05:18:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 18604 states and 22168 transitions. [2024-11-28 05:18:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 05:18:27,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:27,910 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-11-28 05:18:27,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:18:28,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-28 05:18:28,111 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:18:28,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 191040524, now seen corresponding path program 1 times [2024-11-28 05:18:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:28,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213334342] [2024-11-28 05:18:28,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:30,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213334342] [2024-11-28 05:18:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213334342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:18:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075585433] [2024-11-28 05:18:30,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:30,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:30,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:30,717 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:30,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:18:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:30,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 05:18:30,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 23 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:34,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:18:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075585433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:18:38,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:18:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 62 [2024-11-28 05:18:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41676807] [2024-11-28 05:18:38,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:18:38,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-28 05:18:38,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:38,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-28 05:18:38,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3497, Unknown=0, NotChecked=0, Total=3782 [2024-11-28 05:18:38,644 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-11-28 05:18:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:56,665 INFO L93 Difference]: Finished difference Result 26519 states and 31670 transitions. [2024-11-28 05:18:56,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-28 05:18:56,666 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-11-28 05:18:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:56,681 INFO L225 Difference]: With dead ends: 26519 [2024-11-28 05:18:56,682 INFO L226 Difference]: Without dead ends: 19944 [2024-11-28 05:18:56,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1622, Invalid=12898, Unknown=0, NotChecked=0, Total=14520 [2024-11-28 05:18:56,687 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1187 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:56,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 3082 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 05:18:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19944 states. [2024-11-28 05:18:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19944 to 18637. [2024-11-28 05:18:59,580 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-11-28 05:18:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18637 states to 18637 states and 22200 transitions. [2024-11-28 05:18:59,608 INFO L78 Accepts]: Start accepts. Automaton has 18637 states and 22200 transitions. Word has length 107 [2024-11-28 05:18:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:59,609 INFO L471 AbstractCegarLoop]: Abstraction has 18637 states and 22200 transitions. [2024-11-28 05:18:59,609 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-11-28 05:18:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 18637 states and 22200 transitions. [2024-11-28 05:18:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-28 05:18:59,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:59,611 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-11-28 05:18:59,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 05:18:59,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 05:18:59,811 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:18:59,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539020, now seen corresponding path program 1 times [2024-11-28 05:18:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696736147] [2024-11-28 05:18:59,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:19:01,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:01,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696736147] [2024-11-28 05:19:01,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696736147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:19:01,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845158869] [2024-11-28 05:19:01,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:01,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:01,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:19:01,546 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:19:01,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:19:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:01,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 05:19:01,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:19:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:19:04,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:19:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:19:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845158869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:19:08,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:19:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 55 [2024-11-28 05:19:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635401580] [2024-11-28 05:19:08,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:19:08,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 05:19:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:08,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 05:19:08,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2736, Unknown=0, NotChecked=0, Total=2970 [2024-11-28 05:19:08,577 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-11-28 05:19:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:39,675 INFO L93 Difference]: Finished difference Result 33916 states and 40625 transitions. [2024-11-28 05:19:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-28 05:19:39,675 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-11-28 05:19:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:39,693 INFO L225 Difference]: With dead ends: 33916 [2024-11-28 05:19:39,693 INFO L226 Difference]: Without dead ends: 24802 [2024-11-28 05:19:39,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8556 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=6244, Invalid=24206, Unknown=0, NotChecked=0, Total=30450 [2024-11-28 05:19:39,700 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 2748 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:39,700 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.8s Time] [2024-11-28 05:19:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24802 states. [2024-11-28 05:19:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24802 to 17137. [2024-11-28 05:19:42,686 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-11-28 05:19:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17137 states to 17137 states and 20445 transitions. [2024-11-28 05:19:42,706 INFO L78 Accepts]: Start accepts. Automaton has 17137 states and 20445 transitions. Word has length 107 [2024-11-28 05:19:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:42,707 INFO L471 AbstractCegarLoop]: Abstraction has 17137 states and 20445 transitions. [2024-11-28 05:19:42,707 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-11-28 05:19:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 17137 states and 20445 transitions. [2024-11-28 05:19:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-28 05:19:42,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:42,712 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-11-28 05:19:42,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:19:42,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 05:19:42,912 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:19:42,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -616907784, now seen corresponding path program 1 times [2024-11-28 05:19:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:42,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151582716] [2024-11-28 05:19:42,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 37 proven. 213 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 05:19:43,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151582716] [2024-11-28 05:19:43,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151582716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:19:43,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695610637] [2024-11-28 05:19:43,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:19:43,769 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:19:43,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:19:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:43,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-28 05:19:43,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:19:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 82 proven. 154 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 05:19:45,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:19:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 37 proven. 199 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 05:19:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695610637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:19:47,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:19:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-11-28 05:19:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513279899] [2024-11-28 05:19:47,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:19:47,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 05:19:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:47,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 05:19:47,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2024-11-28 05:19:47,503 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-11-28 05:19:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:50,907 INFO L93 Difference]: Finished difference Result 25949 states and 31121 transitions. [2024-11-28 05:19:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:19:50,907 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-11-28 05:19:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:50,922 INFO L225 Difference]: With dead ends: 25949 [2024-11-28 05:19:50,922 INFO L226 Difference]: Without dead ends: 17266 [2024-11-28 05:19:50,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2024-11-28 05:19:50,927 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-11-28 05:19:50,928 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-11-28 05:19:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17266 states. [2024-11-28 05:19:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17266 to 17137. [2024-11-28 05:19:53,733 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-11-28 05:19:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17137 states to 17137 states and 20301 transitions. [2024-11-28 05:19:53,751 INFO L78 Accepts]: Start accepts. Automaton has 17137 states and 20301 transitions. Word has length 146 [2024-11-28 05:19:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:53,751 INFO L471 AbstractCegarLoop]: Abstraction has 17137 states and 20301 transitions. [2024-11-28 05:19:53,752 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-11-28 05:19:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17137 states and 20301 transitions. [2024-11-28 05:19:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-28 05:19:53,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:53,755 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-11-28 05:19:53,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 05:19:53,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:53,955 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:19:53,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2116474254, now seen corresponding path program 1 times [2024-11-28 05:19:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:53,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878017426] [2024-11-28 05:19:53,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 39 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:19:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878017426] [2024-11-28 05:19:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878017426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:19:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949664782] [2024-11-28 05:19:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:55,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:19:55,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:19:55,168 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:19:55,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 05:19:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:55,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 05:19:55,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:19:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 145 proven. 69 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-28 05:19:58,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:20:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 27 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:20:08,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949664782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:20:08,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:20:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 30] total 70 [2024-11-28 05:20:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695237250] [2024-11-28 05:20:08,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:20:08,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-28 05:20:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:20:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-28 05:20:08,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=4265, Unknown=0, NotChecked=0, Total=4830 [2024-11-28 05:20:08,345 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-11-28 05:20:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:20:25,530 INFO L93 Difference]: Finished difference Result 23936 states and 28378 transitions. [2024-11-28 05:20:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-11-28 05:20:25,531 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-11-28 05:20:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:20:25,551 INFO L225 Difference]: With dead ends: 23936 [2024-11-28 05:20:25,551 INFO L226 Difference]: Without dead ends: 19001 [2024-11-28 05:20:25,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=4846, Invalid=21560, Unknown=0, NotChecked=0, Total=26406 [2024-11-28 05:20:25,561 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 2171 mSDsluCounter, 3584 mSDsCounter, 0 mSdLazyCounter, 3573 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:20:25,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 3764 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3573 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 05:20:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19001 states. [2024-11-28 05:20:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19001 to 12849. [2024-11-28 05:20:27,879 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-11-28 05:20:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12849 states to 12849 states and 15196 transitions. [2024-11-28 05:20:27,894 INFO L78 Accepts]: Start accepts. Automaton has 12849 states and 15196 transitions. Word has length 146 [2024-11-28 05:20:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:20:27,895 INFO L471 AbstractCegarLoop]: Abstraction has 12849 states and 15196 transitions. [2024-11-28 05:20:27,895 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-11-28 05:20:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 12849 states and 15196 transitions. [2024-11-28 05:20:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-28 05:20:27,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:20:27,899 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-11-28 05:20:27,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 05:20:28,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:20:28,099 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 05:20:28,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:20:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash -204358436, now seen corresponding path program 1 times [2024-11-28 05:20:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:20:28,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159655950] [2024-11-28 05:20:28,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:20:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:20:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:20:28,151 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 05:20:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 05:20:28,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 05:20:28,274 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 05:20:28,275 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 05:20:28,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 05:20:28,281 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-11-28 05:20:28,486 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:20:28,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:20:28 BoogieIcfgContainer [2024-11-28 05:20:28,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:20:28,490 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:20:28,490 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:20:28,490 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:20:28,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:48" (3/4) ... [2024-11-28 05:20:28,492 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 05:20:28,719 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 153. [2024-11-28 05:20:28,906 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 05:20:28,906 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 05:20:28,906 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:20:28,907 INFO L158 Benchmark]: Toolchain (without parser) took 821085.54ms. Allocated memory was 117.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 92.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 940.2MB. Max. memory is 16.1GB. [2024-11-28 05:20:28,907 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:28,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.58ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.9MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:20:28,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.28ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 77.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:28,914 INFO L158 Benchmark]: Boogie Preprocessor took 67.47ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:20:28,915 INFO L158 Benchmark]: RCFGBuilder took 532.41ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 55.9MB in the end (delta: 19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:20:28,915 INFO L158 Benchmark]: TraceAbstraction took 819642.23ms. Allocated memory was 117.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 55.2MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 889.9MB. Max. memory is 16.1GB. [2024-11-28 05:20:28,915 INFO L158 Benchmark]: Witness Printer took 416.34ms. Allocated memory is still 3.2GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 05:20:28,916 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.39ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.58ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.9MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.28ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 77.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.47ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 532.41ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 55.9MB in the end (delta: 19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 819642.23ms. Allocated memory was 117.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 55.2MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 889.9MB. Max. memory is 16.1GB. * Witness Printer took 416.34ms. Allocated memory is still 3.2GB. Free memory was 2.3GB in the beginning and 2.3GB 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: 819.4s, OverallIterations: 32, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 635.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40518 SdHoareTripleChecker+Valid, 48.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40518 mSDsluCounter, 50314 SdHoareTripleChecker+Invalid, 43.1s 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.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5340 GetRequests, 2792 SyntacticMatches, 6 SemanticMatches, 2542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179249 ImplicationChecksByTransitivity, 597.5s 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: 27.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 85619 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 149.0s 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-11-28 05:20:29,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e299af9-4db5-45f6-94cd-662d655cc083/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE