./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/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_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/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_3a32e313-d138-46b0-afa5-f240195e2cec/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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:28:56,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:28:56,644 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:28:56,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:28:56,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:28:56,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:28:56,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:28:56,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:28:56,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:28:56,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:28:56,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:28:56,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:28:56,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:28:56,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:28:56,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:28:56,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:28:56,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:28:56,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:28:56,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:28:56,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:28:56,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:28:56,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:28:56,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:28:56,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:28:56,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:28:56,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:28:56,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:28:56,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:28:56,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:28:56,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:28:56,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:28:56,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:28:56,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:28:56,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:28:56,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:28:56,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:28:56,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:28:56,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:28:56,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:28:56,683 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_3a32e313-d138-46b0-afa5-f240195e2cec/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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2024-11-27 20:28:56,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:28:56,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:28:56,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:28:57,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:28:57,001 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:28:57,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/systemc/toy.cil.c [2024-11-27 20:29:00,149 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/data/93e0af143/6358377259ed42c193c019f658c9bcb9/FLAGd184a6e7c [2024-11-27 20:29:00,469 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:29:00,470 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/sv-benchmarks/c/systemc/toy.cil.c [2024-11-27 20:29:00,489 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/data/93e0af143/6358377259ed42c193c019f658c9bcb9/FLAGd184a6e7c [2024-11-27 20:29:00,517 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/data/93e0af143/6358377259ed42c193c019f658c9bcb9 [2024-11-27 20:29:00,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:29:00,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:29:00,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:29:00,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:29:00,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:29:00,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:29:00" (1/1) ... [2024-11-27 20:29:00,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c20c150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:00, skipping insertion in model container [2024-11-27 20:29:00,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:29:00" (1/1) ... [2024-11-27 20:29:00,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:29:00,803 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_3a32e313-d138-46b0-afa5-f240195e2cec/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2024-11-27 20:29:00,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:29:00,954 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:29:00,966 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_3a32e313-d138-46b0-afa5-f240195e2cec/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2024-11-27 20:29:01,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:29:01,063 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:29:01,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01 WrapperNode [2024-11-27 20:29:01,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:29:01,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:29:01,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:29:01,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:29:01,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,128 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 360 [2024-11-27 20:29:01,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:29:01,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:29:01,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:29:01,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:29:01,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,157 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:29:01,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:29:01,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:29:01,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:29:01,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:29:01,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (1/1) ... [2024-11-27 20:29:01,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:29:01,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:29:01,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:29:01,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:29:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:29:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:29:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:29:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:29:01,381 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:29:01,384 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:29:01,968 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-27 20:29:01,968 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:29:01,988 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:29:01,991 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-27 20:29:01,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:29:01 BoogieIcfgContainer [2024-11-27 20:29:01,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:29:01,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:29:01,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:29:02,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:29:02,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:29:00" (1/3) ... [2024-11-27 20:29:02,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e043bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:29:02, skipping insertion in model container [2024-11-27 20:29:02,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:29:01" (2/3) ... [2024-11-27 20:29:02,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e043bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:29:02, skipping insertion in model container [2024-11-27 20:29:02,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:29:01" (3/3) ... [2024-11-27 20:29:02,007 INFO L128 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2024-11-27 20:29:02,026 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:29:02,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG toy.cil.c that has 1 procedures, 126 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-11-27 20:29:02,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:29:02,139 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;@313ea158, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:29:02,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:29:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-27 20:29:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:02,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:02,157 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] [2024-11-27 20:29:02,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:02,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash -272319407, now seen corresponding path program 1 times [2024-11-27 20:29:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847762957] [2024-11-27 20:29:02,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847762957] [2024-11-27 20:29:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847762957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811644644] [2024-11-27 20:29:02,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:02,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:02,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:02,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:02,608 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 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 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:02,664 INFO L93 Difference]: Finished difference Result 243 states and 452 transitions. [2024-11-27 20:29:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:02,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:02,677 INFO L225 Difference]: With dead ends: 243 [2024-11-27 20:29:02,678 INFO L226 Difference]: Without dead ends: 121 [2024-11-27 20:29:02,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:02,685 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:02,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-27 20:29:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-27 20:29:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.7833333333333334) internal successors, (214), 120 states have internal predecessors, (214), 0 states have call successors, (0), 0 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-27 20:29:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2024-11-27 20:29:02,735 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 214 transitions. Word has length 34 [2024-11-27 20:29:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:02,736 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 214 transitions. [2024-11-27 20:29:02,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 214 transitions. [2024-11-27 20:29:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:02,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:02,738 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] [2024-11-27 20:29:02,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:29:02,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:02,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1658522801, now seen corresponding path program 1 times [2024-11-27 20:29:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:02,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149437948] [2024-11-27 20:29:02,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:02,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:02,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149437948] [2024-11-27 20:29:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149437948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:02,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:02,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:02,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983422636] [2024-11-27 20:29:02,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:02,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:02,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:02,936 INFO L87 Difference]: Start difference. First operand 121 states and 214 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:03,026 INFO L93 Difference]: Finished difference Result 325 states and 574 transitions. [2024-11-27 20:29:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:29:03,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:03,028 INFO L225 Difference]: With dead ends: 325 [2024-11-27 20:29:03,028 INFO L226 Difference]: Without dead ends: 207 [2024-11-27 20:29:03,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:03,030 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 556 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:03,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 358 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-27 20:29:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-11-27 20:29:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.7684729064039408) internal successors, (359), 203 states have internal predecessors, (359), 0 states have call successors, (0), 0 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-27 20:29:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 359 transitions. [2024-11-27 20:29:03,058 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 359 transitions. Word has length 34 [2024-11-27 20:29:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:03,059 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 359 transitions. [2024-11-27 20:29:03,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 359 transitions. [2024-11-27 20:29:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:03,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:03,063 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] [2024-11-27 20:29:03,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:29:03,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:03,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash 264705233, now seen corresponding path program 1 times [2024-11-27 20:29:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:03,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682505874] [2024-11-27 20:29:03,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:03,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:03,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682505874] [2024-11-27 20:29:03,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682505874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:03,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:03,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:03,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984521686] [2024-11-27 20:29:03,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:03,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:03,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:03,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:03,219 INFO L87 Difference]: Start difference. First operand 204 states and 359 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:03,279 INFO L93 Difference]: Finished difference Result 399 states and 705 transitions. [2024-11-27 20:29:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:03,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:03,281 INFO L225 Difference]: With dead ends: 399 [2024-11-27 20:29:03,281 INFO L226 Difference]: Without dead ends: 204 [2024-11-27 20:29:03,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:03,283 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 183 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:03,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 197 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-27 20:29:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-27 20:29:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.70935960591133) internal successors, (347), 203 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-27 20:29:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 347 transitions. [2024-11-27 20:29:03,300 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 347 transitions. Word has length 34 [2024-11-27 20:29:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:03,301 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 347 transitions. [2024-11-27 20:29:03,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 347 transitions. [2024-11-27 20:29:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:03,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:03,302 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] [2024-11-27 20:29:03,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:29:03,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:03,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash -684372403, now seen corresponding path program 1 times [2024-11-27 20:29:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:03,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117107760] [2024-11-27 20:29:03,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:03,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:03,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117107760] [2024-11-27 20:29:03,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117107760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:03,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:03,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350857681] [2024-11-27 20:29:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:03,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:03,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:03,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:03,438 INFO L87 Difference]: Start difference. First operand 204 states and 347 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:03,617 INFO L93 Difference]: Finished difference Result 553 states and 944 transitions. [2024-11-27 20:29:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:03,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:03,622 INFO L225 Difference]: With dead ends: 553 [2024-11-27 20:29:03,624 INFO L226 Difference]: Without dead ends: 359 [2024-11-27 20:29:03,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:03,629 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 357 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:03,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 440 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-27 20:29:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 204. [2024-11-27 20:29:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.6945812807881773) internal successors, (344), 203 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-27 20:29:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 344 transitions. [2024-11-27 20:29:03,678 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 344 transitions. Word has length 34 [2024-11-27 20:29:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 344 transitions. [2024-11-27 20:29:03,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 344 transitions. [2024-11-27 20:29:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:03,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:03,683 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] [2024-11-27 20:29:03,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:29:03,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -543823793, now seen corresponding path program 1 times [2024-11-27 20:29:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549757668] [2024-11-27 20:29:03,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549757668] [2024-11-27 20:29:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549757668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819315227] [2024-11-27 20:29:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:03,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:03,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:03,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:03,790 INFO L87 Difference]: Start difference. First operand 204 states and 344 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:03,916 INFO L93 Difference]: Finished difference Result 554 states and 938 transitions. [2024-11-27 20:29:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:03,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:03,919 INFO L225 Difference]: With dead ends: 554 [2024-11-27 20:29:03,919 INFO L226 Difference]: Without dead ends: 361 [2024-11-27 20:29:03,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:03,923 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 355 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:03,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 447 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-27 20:29:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 204. [2024-11-27 20:29:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.6798029556650247) internal successors, (341), 203 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-27 20:29:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 341 transitions. [2024-11-27 20:29:03,958 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 341 transitions. Word has length 34 [2024-11-27 20:29:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:03,958 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 341 transitions. [2024-11-27 20:29:03,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 341 transitions. [2024-11-27 20:29:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:03,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:03,961 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] [2024-11-27 20:29:03,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:29:03,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:03,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash -677837299, now seen corresponding path program 1 times [2024-11-27 20:29:03,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:03,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873012517] [2024-11-27 20:29:03,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:04,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:04,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873012517] [2024-11-27 20:29:04,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873012517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:04,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:04,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:04,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807042803] [2024-11-27 20:29:04,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:04,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:04,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:04,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:04,058 INFO L87 Difference]: Start difference. First operand 204 states and 341 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:04,182 INFO L93 Difference]: Finished difference Result 568 states and 951 transitions. [2024-11-27 20:29:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:04,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:04,185 INFO L225 Difference]: With dead ends: 568 [2024-11-27 20:29:04,185 INFO L226 Difference]: Without dead ends: 376 [2024-11-27 20:29:04,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:04,186 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 361 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:04,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 457 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-27 20:29:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 210. [2024-11-27 20:29:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.6507177033492824) internal successors, (345), 209 states have internal predecessors, (345), 0 states have call successors, (0), 0 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-27 20:29:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 345 transitions. [2024-11-27 20:29:04,204 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 345 transitions. Word has length 34 [2024-11-27 20:29:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:04,204 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 345 transitions. [2024-11-27 20:29:04,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 345 transitions. [2024-11-27 20:29:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:04,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:04,205 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] [2024-11-27 20:29:04,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:29:04,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:04,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1811691663, now seen corresponding path program 1 times [2024-11-27 20:29:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:04,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723447539] [2024-11-27 20:29:04,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:04,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:04,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723447539] [2024-11-27 20:29:04,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723447539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:04,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:04,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:04,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806411472] [2024-11-27 20:29:04,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:04,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:04,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:04,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:04,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:04,299 INFO L87 Difference]: Start difference. First operand 210 states and 345 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:04,463 INFO L93 Difference]: Finished difference Result 713 states and 1173 transitions. [2024-11-27 20:29:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:04,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:04,469 INFO L225 Difference]: With dead ends: 713 [2024-11-27 20:29:04,469 INFO L226 Difference]: Without dead ends: 516 [2024-11-27 20:29:04,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:04,471 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 357 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:04,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 546 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:04,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-27 20:29:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 343. [2024-11-27 20:29:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.6374269005847952) internal successors, (560), 342 states have internal predecessors, (560), 0 states have call successors, (0), 0 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-27 20:29:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions. [2024-11-27 20:29:04,507 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 34 [2024-11-27 20:29:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:04,507 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions. [2024-11-27 20:29:04,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions. [2024-11-27 20:29:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:04,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:04,509 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] [2024-11-27 20:29:04,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:29:04,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:04,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:04,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2030546381, now seen corresponding path program 1 times [2024-11-27 20:29:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24345320] [2024-11-27 20:29:04,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:04,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:04,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24345320] [2024-11-27 20:29:04,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24345320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:04,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706576750] [2024-11-27 20:29:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:04,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:04,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:04,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:04,596 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:04,656 INFO L93 Difference]: Finished difference Result 817 states and 1340 transitions. [2024-11-27 20:29:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:04,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:04,660 INFO L225 Difference]: With dead ends: 817 [2024-11-27 20:29:04,660 INFO L226 Difference]: Without dead ends: 498 [2024-11-27 20:29:04,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:04,663 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 171 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:04,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 331 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-27 20:29:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2024-11-27 20:29:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.6343434343434344) internal successors, (809), 495 states have internal predecessors, (809), 0 states have call successors, (0), 0 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-27 20:29:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 809 transitions. [2024-11-27 20:29:04,703 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 809 transitions. Word has length 34 [2024-11-27 20:29:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:04,703 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 809 transitions. [2024-11-27 20:29:04,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 809 transitions. [2024-11-27 20:29:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:04,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:04,704 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] [2024-11-27 20:29:04,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:29:04,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:04,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1267643465, now seen corresponding path program 1 times [2024-11-27 20:29:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723391387] [2024-11-27 20:29:04,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:04,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:04,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723391387] [2024-11-27 20:29:04,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723391387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:04,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:04,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:04,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043491774] [2024-11-27 20:29:04,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:04,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:04,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:04,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:04,797 INFO L87 Difference]: Start difference. First operand 496 states and 809 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:04,923 INFO L93 Difference]: Finished difference Result 1259 states and 2057 transitions. [2024-11-27 20:29:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:29:04,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:04,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:04,929 INFO L225 Difference]: With dead ends: 1259 [2024-11-27 20:29:04,930 INFO L226 Difference]: Without dead ends: 780 [2024-11-27 20:29:04,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:04,931 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 465 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:04,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 319 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-27 20:29:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 496. [2024-11-27 20:29:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.6181818181818182) internal successors, (801), 495 states have internal predecessors, (801), 0 states have call successors, (0), 0 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-27 20:29:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 801 transitions. [2024-11-27 20:29:04,985 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 801 transitions. Word has length 34 [2024-11-27 20:29:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:04,985 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 801 transitions. [2024-11-27 20:29:04,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 801 transitions. [2024-11-27 20:29:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:04,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:04,986 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] [2024-11-27 20:29:04,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:29:04,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:04,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash -12220213, now seen corresponding path program 1 times [2024-11-27 20:29:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:04,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885064524] [2024-11-27 20:29:04,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:05,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:05,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885064524] [2024-11-27 20:29:05,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885064524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:05,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:05,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716386838] [2024-11-27 20:29:05,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:05,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:05,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:05,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:05,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:05,043 INFO L87 Difference]: Start difference. First operand 496 states and 801 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:05,173 INFO L93 Difference]: Finished difference Result 1259 states and 2034 transitions. [2024-11-27 20:29:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:29:05,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:05,176 INFO L225 Difference]: With dead ends: 1259 [2024-11-27 20:29:05,177 INFO L226 Difference]: Without dead ends: 786 [2024-11-27 20:29:05,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:05,179 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 449 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:05,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 308 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-27 20:29:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 496. [2024-11-27 20:29:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.6020202020202021) internal successors, (793), 495 states have internal predecessors, (793), 0 states have call successors, (0), 0 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-27 20:29:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 793 transitions. [2024-11-27 20:29:05,228 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 793 transitions. Word has length 34 [2024-11-27 20:29:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:05,228 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 793 transitions. [2024-11-27 20:29:05,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 793 transitions. [2024-11-27 20:29:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:05,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:05,230 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] [2024-11-27 20:29:05,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:29:05,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:05,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash -599026227, now seen corresponding path program 1 times [2024-11-27 20:29:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:05,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466287276] [2024-11-27 20:29:05,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:05,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466287276] [2024-11-27 20:29:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466287276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61305182] [2024-11-27 20:29:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:05,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:05,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:05,308 INFO L87 Difference]: Start difference. First operand 496 states and 793 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:05,436 INFO L93 Difference]: Finished difference Result 1198 states and 1912 transitions. [2024-11-27 20:29:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:29:05,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:05,439 INFO L225 Difference]: With dead ends: 1198 [2024-11-27 20:29:05,439 INFO L226 Difference]: Without dead ends: 719 [2024-11-27 20:29:05,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:05,441 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 461 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:05,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 338 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-27 20:29:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 544. [2024-11-27 20:29:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.565377532228361) internal successors, (850), 543 states have internal predecessors, (850), 0 states have call successors, (0), 0 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-27 20:29:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 850 transitions. [2024-11-27 20:29:05,493 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 850 transitions. Word has length 34 [2024-11-27 20:29:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:05,493 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 850 transitions. [2024-11-27 20:29:05,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 850 transitions. [2024-11-27 20:29:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:29:05,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:05,494 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] [2024-11-27 20:29:05,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:29:05,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:05,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 102038351, now seen corresponding path program 1 times [2024-11-27 20:29:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411318991] [2024-11-27 20:29:05,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411318991] [2024-11-27 20:29:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411318991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:05,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:05,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545388212] [2024-11-27 20:29:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:05,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:05,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:05,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:05,531 INFO L87 Difference]: Start difference. First operand 544 states and 850 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:05,629 INFO L93 Difference]: Finished difference Result 1291 states and 2023 transitions. [2024-11-27 20:29:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:05,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-27 20:29:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:05,632 INFO L225 Difference]: With dead ends: 1291 [2024-11-27 20:29:05,632 INFO L226 Difference]: Without dead ends: 761 [2024-11-27 20:29:05,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:05,634 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 115 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:05,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 300 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-27 20:29:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 758. [2024-11-27 20:29:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 1.546895640686922) internal successors, (1171), 757 states have internal predecessors, (1171), 0 states have call successors, (0), 0 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-27 20:29:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1171 transitions. [2024-11-27 20:29:05,691 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1171 transitions. Word has length 34 [2024-11-27 20:29:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:05,691 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1171 transitions. [2024-11-27 20:29:05,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-27 20:29:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1171 transitions. [2024-11-27 20:29:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 20:29:05,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:05,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:05,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:29:05,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:05,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash -987991270, now seen corresponding path program 1 times [2024-11-27 20:29:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:05,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409194887] [2024-11-27 20:29:05,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:05,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:05,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409194887] [2024-11-27 20:29:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409194887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:05,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357839059] [2024-11-27 20:29:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:05,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:05,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:05,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:05,732 INFO L87 Difference]: Start difference. First operand 758 states and 1171 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-27 20:29:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:05,847 INFO L93 Difference]: Finished difference Result 1864 states and 2921 transitions. [2024-11-27 20:29:05,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:05,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-27 20:29:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:05,852 INFO L225 Difference]: With dead ends: 1864 [2024-11-27 20:29:05,852 INFO L226 Difference]: Without dead ends: 1133 [2024-11-27 20:29:05,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:05,854 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 78 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:05,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 399 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-27 20:29:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2024-11-27 20:29:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.5610619469026548) internal successors, (1764), 1130 states have internal predecessors, (1764), 0 states have call successors, (0), 0 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-27 20:29:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1764 transitions. [2024-11-27 20:29:05,947 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1764 transitions. Word has length 44 [2024-11-27 20:29:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:05,947 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1764 transitions. [2024-11-27 20:29:05,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-27 20:29:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1764 transitions. [2024-11-27 20:29:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 20:29:05,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:05,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:05,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:29:05,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:05,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1935168728, now seen corresponding path program 1 times [2024-11-27 20:29:05,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:05,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065835337] [2024-11-27 20:29:05,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 20:29:06,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:06,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065835337] [2024-11-27 20:29:06,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065835337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:06,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:06,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:06,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596374076] [2024-11-27 20:29:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:06,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:06,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:06,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:06,023 INFO L87 Difference]: Start difference. First operand 1131 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:29:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:06,132 INFO L93 Difference]: Finished difference Result 2213 states and 3469 transitions. [2024-11-27 20:29:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-27 20:29:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:06,138 INFO L225 Difference]: With dead ends: 2213 [2024-11-27 20:29:06,138 INFO L226 Difference]: Without dead ends: 1109 [2024-11-27 20:29:06,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:06,141 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:06,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-27 20:29:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2024-11-27 20:29:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 1108 states have (on average 1.5676895306859207) internal successors, (1737), 1108 states have internal predecessors, (1737), 0 states have call successors, (0), 0 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-27 20:29:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1737 transitions. [2024-11-27 20:29:06,239 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1737 transitions. Word has length 44 [2024-11-27 20:29:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:06,239 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1737 transitions. [2024-11-27 20:29:06,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:29:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1737 transitions. [2024-11-27 20:29:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-27 20:29:06,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:06,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:06,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:29:06,241 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:06,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1149237581, now seen corresponding path program 1 times [2024-11-27 20:29:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278619083] [2024-11-27 20:29:06,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:06,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:06,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278619083] [2024-11-27 20:29:06,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278619083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:06,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346897014] [2024-11-27 20:29:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:06,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:06,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:06,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:06,310 INFO L87 Difference]: Start difference. First operand 1109 states and 1737 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-27 20:29:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:06,454 INFO L93 Difference]: Finished difference Result 2818 states and 4473 transitions. [2024-11-27 20:29:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:06,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-11-27 20:29:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:06,463 INFO L225 Difference]: With dead ends: 2818 [2024-11-27 20:29:06,463 INFO L226 Difference]: Without dead ends: 1736 [2024-11-27 20:29:06,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:06,467 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 79 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:06,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 310 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2024-11-27 20:29:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1734. [2024-11-27 20:29:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1733 states have (on average 1.581073283323716) internal successors, (2740), 1733 states have internal predecessors, (2740), 0 states have call successors, (0), 0 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-27 20:29:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2740 transitions. [2024-11-27 20:29:06,617 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2740 transitions. Word has length 45 [2024-11-27 20:29:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:06,617 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2740 transitions. [2024-11-27 20:29:06,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-27 20:29:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2740 transitions. [2024-11-27 20:29:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-27 20:29:06,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:06,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:06,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:29:06,620 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:06,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash 18508592, now seen corresponding path program 1 times [2024-11-27 20:29:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382860210] [2024-11-27 20:29:06,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382860210] [2024-11-27 20:29:06,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382860210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:06,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:06,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:06,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536953570] [2024-11-27 20:29:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:06,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:06,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:06,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:06,670 INFO L87 Difference]: Start difference. First operand 1734 states and 2740 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-27 20:29:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:06,951 INFO L93 Difference]: Finished difference Result 4672 states and 7473 transitions. [2024-11-27 20:29:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-27 20:29:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:06,964 INFO L225 Difference]: With dead ends: 4672 [2024-11-27 20:29:06,964 INFO L226 Difference]: Without dead ends: 2966 [2024-11-27 20:29:06,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:06,967 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 83 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:06,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 372 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2024-11-27 20:29:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2964. [2024-11-27 20:29:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2963 states have (on average 1.592980087748903) internal successors, (4720), 2963 states have internal predecessors, (4720), 0 states have call successors, (0), 0 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-27 20:29:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4720 transitions. [2024-11-27 20:29:07,298 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4720 transitions. Word has length 46 [2024-11-27 20:29:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:07,299 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 4720 transitions. [2024-11-27 20:29:07,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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-27 20:29:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4720 transitions. [2024-11-27 20:29:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-27 20:29:07,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:07,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:07,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:29:07,303 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:07,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1353298706, now seen corresponding path program 1 times [2024-11-27 20:29:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:07,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444587675] [2024-11-27 20:29:07,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 20:29:07,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:07,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444587675] [2024-11-27 20:29:07,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444587675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:07,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:07,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:07,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374970343] [2024-11-27 20:29:07,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:07,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:07,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:07,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:07,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:07,351 INFO L87 Difference]: Start difference. First operand 2964 states and 4720 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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-27 20:29:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:07,707 INFO L93 Difference]: Finished difference Result 5879 states and 9383 transitions. [2024-11-27 20:29:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:07,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 46 [2024-11-27 20:29:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:07,723 INFO L225 Difference]: With dead ends: 5879 [2024-11-27 20:29:07,723 INFO L226 Difference]: Without dead ends: 2943 [2024-11-27 20:29:07,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:07,728 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:07,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2024-11-27 20:29:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2943. [2024-11-27 20:29:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2942 states have (on average 1.5958531611148878) internal successors, (4695), 2942 states have internal predecessors, (4695), 0 states have call successors, (0), 0 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-27 20:29:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4695 transitions. [2024-11-27 20:29:08,056 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 4695 transitions. Word has length 46 [2024-11-27 20:29:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:08,056 INFO L471 AbstractCegarLoop]: Abstraction has 2943 states and 4695 transitions. [2024-11-27 20:29:08,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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-27 20:29:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 4695 transitions. [2024-11-27 20:29:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 20:29:08,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:08,058 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-27 20:29:08,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:29:08,059 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:08,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1046940361, now seen corresponding path program 1 times [2024-11-27 20:29:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:08,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680669073] [2024-11-27 20:29:08,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680669073] [2024-11-27 20:29:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680669073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068870412] [2024-11-27 20:29:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:08,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:08,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:08,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:08,151 INFO L87 Difference]: Start difference. First operand 2943 states and 4695 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-27 20:29:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:08,557 INFO L93 Difference]: Finished difference Result 7464 states and 11952 transitions. [2024-11-27 20:29:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:08,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-27 20:29:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:08,577 INFO L225 Difference]: With dead ends: 7464 [2024-11-27 20:29:08,577 INFO L226 Difference]: Without dead ends: 3829 [2024-11-27 20:29:08,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:08,582 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 387 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:08,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 292 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2024-11-27 20:29:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3829. [2024-11-27 20:29:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3829 states, 3828 states have (on average 1.5856844305120168) internal successors, (6070), 3828 states have internal predecessors, (6070), 0 states have call successors, (0), 0 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-27 20:29:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 6070 transitions. [2024-11-27 20:29:08,949 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 6070 transitions. Word has length 47 [2024-11-27 20:29:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:08,950 INFO L471 AbstractCegarLoop]: Abstraction has 3829 states and 6070 transitions. [2024-11-27 20:29:08,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-27 20:29:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 6070 transitions. [2024-11-27 20:29:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 20:29:08,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:08,953 INFO L218 NwaCegarLoop]: trace histogram [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-27 20:29:08,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:29:08,953 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1971785546, now seen corresponding path program 1 times [2024-11-27 20:29:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321642848] [2024-11-27 20:29:08,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:08,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:09,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321642848] [2024-11-27 20:29:09,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321642848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:09,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:09,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:29:09,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672552466] [2024-11-27 20:29:09,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:09,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:29:09,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:09,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:29:09,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:09,082 INFO L87 Difference]: Start difference. First operand 3829 states and 6070 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-27 20:29:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:09,727 INFO L93 Difference]: Finished difference Result 9643 states and 15249 transitions. [2024-11-27 20:29:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:29:09,727 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 53 [2024-11-27 20:29:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:09,766 INFO L225 Difference]: With dead ends: 9643 [2024-11-27 20:29:09,767 INFO L226 Difference]: Without dead ends: 5836 [2024-11-27 20:29:09,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:29:09,773 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 658 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:09,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 490 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5836 states. [2024-11-27 20:29:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5836 to 4409. [2024-11-27 20:29:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.558983666061706) internal successors, (6872), 4408 states have internal predecessors, (6872), 0 states have call successors, (0), 0 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-27 20:29:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6872 transitions. [2024-11-27 20:29:10,189 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 6872 transitions. Word has length 53 [2024-11-27 20:29:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:10,189 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 6872 transitions. [2024-11-27 20:29:10,189 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-27 20:29:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 6872 transitions. [2024-11-27 20:29:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-27 20:29:10,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:10,196 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:10,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:29:10,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:10,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1170326885, now seen corresponding path program 1 times [2024-11-27 20:29:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:10,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645106860] [2024-11-27 20:29:10,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:10,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645106860] [2024-11-27 20:29:10,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645106860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:10,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729379615] [2024-11-27 20:29:10,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:10,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:10,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:10,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:10,264 INFO L87 Difference]: Start difference. First operand 4409 states and 6872 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-27 20:29:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:10,662 INFO L93 Difference]: Finished difference Result 9117 states and 14186 transitions. [2024-11-27 20:29:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-27 20:29:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:10,681 INFO L225 Difference]: With dead ends: 9117 [2024-11-27 20:29:10,681 INFO L226 Difference]: Without dead ends: 4736 [2024-11-27 20:29:10,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:10,692 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 125 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:10,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 295 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4736 states. [2024-11-27 20:29:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4736 to 4720. [2024-11-27 20:29:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4720 states, 4719 states have (on average 1.5070989616444161) internal successors, (7112), 4719 states have internal predecessors, (7112), 0 states have call successors, (0), 0 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-27 20:29:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4720 states to 4720 states and 7112 transitions. [2024-11-27 20:29:11,107 INFO L78 Accepts]: Start accepts. Automaton has 4720 states and 7112 transitions. Word has length 82 [2024-11-27 20:29:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:11,108 INFO L471 AbstractCegarLoop]: Abstraction has 4720 states and 7112 transitions. [2024-11-27 20:29:11,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-27 20:29:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4720 states and 7112 transitions. [2024-11-27 20:29:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-27 20:29:11,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:11,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 20:29:11,119 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:11,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:11,119 INFO L85 PathProgramCache]: Analyzing trace with hash -782980972, now seen corresponding path program 1 times [2024-11-27 20:29:11,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:11,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969983469] [2024-11-27 20:29:11,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:11,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969983469] [2024-11-27 20:29:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969983469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:11,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:11,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042843392] [2024-11-27 20:29:11,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:11,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:11,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:11,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:11,196 INFO L87 Difference]: Start difference. First operand 4720 states and 7112 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-27 20:29:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:11,818 INFO L93 Difference]: Finished difference Result 9885 states and 14866 transitions. [2024-11-27 20:29:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:11,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-27 20:29:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:11,850 INFO L225 Difference]: With dead ends: 9885 [2024-11-27 20:29:11,850 INFO L226 Difference]: Without dead ends: 5204 [2024-11-27 20:29:11,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:11,859 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 123 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:11,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 294 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2024-11-27 20:29:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 5180. [2024-11-27 20:29:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 5179 states have (on average 1.4560726008882023) internal successors, (7541), 5179 states have internal predecessors, (7541), 0 states have call successors, (0), 0 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-27 20:29:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 7541 transitions. [2024-11-27 20:29:12,404 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 7541 transitions. Word has length 83 [2024-11-27 20:29:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:12,405 INFO L471 AbstractCegarLoop]: Abstraction has 5180 states and 7541 transitions. [2024-11-27 20:29:12,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-27 20:29:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 7541 transitions. [2024-11-27 20:29:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-27 20:29:12,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:12,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:12,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 20:29:12,411 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:12,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -297706215, now seen corresponding path program 1 times [2024-11-27 20:29:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108179380] [2024-11-27 20:29:12,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:29:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108179380] [2024-11-27 20:29:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108179380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:12,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775546268] [2024-11-27 20:29:12,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:12,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:12,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:12,473 INFO L87 Difference]: Start difference. First operand 5180 states and 7541 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-27 20:29:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:12,865 INFO L93 Difference]: Finished difference Result 10658 states and 15524 transitions. [2024-11-27 20:29:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-27 20:29:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:12,886 INFO L225 Difference]: With dead ends: 10658 [2024-11-27 20:29:12,887 INFO L226 Difference]: Without dead ends: 5535 [2024-11-27 20:29:12,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:12,900 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 118 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:12,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 291 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2024-11-27 20:29:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 4971. [2024-11-27 20:29:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4971 states, 4970 states have (on average 1.3915492957746478) internal successors, (6916), 4970 states have internal predecessors, (6916), 0 states have call successors, (0), 0 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-27 20:29:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 6916 transitions. [2024-11-27 20:29:13,316 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 6916 transitions. Word has length 84 [2024-11-27 20:29:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:13,317 INFO L471 AbstractCegarLoop]: Abstraction has 4971 states and 6916 transitions. [2024-11-27 20:29:13,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-27 20:29:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 6916 transitions. [2024-11-27 20:29:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 20:29:13,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:13,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:13,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 20:29:13,323 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:13,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:13,323 INFO L85 PathProgramCache]: Analyzing trace with hash -34803178, now seen corresponding path program 1 times [2024-11-27 20:29:13,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:13,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854728507] [2024-11-27 20:29:13,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:13,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:29:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:13,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854728507] [2024-11-27 20:29:13,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854728507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:13,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:13,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492636453] [2024-11-27 20:29:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:13,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:13,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:13,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:13,439 INFO L87 Difference]: Start difference. First operand 4971 states and 6916 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-27 20:29:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:14,008 INFO L93 Difference]: Finished difference Result 9283 states and 12848 transitions. [2024-11-27 20:29:14,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:14,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-27 20:29:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:14,025 INFO L225 Difference]: With dead ends: 9283 [2024-11-27 20:29:14,025 INFO L226 Difference]: Without dead ends: 4750 [2024-11-27 20:29:14,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:14,032 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 426 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:14,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 374 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:29:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4750 states. [2024-11-27 20:29:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4750 to 4652. [2024-11-27 20:29:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4652 states, 4651 states have (on average 1.3420769726940442) internal successors, (6242), 4651 states have internal predecessors, (6242), 0 states have call successors, (0), 0 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-27 20:29:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4652 states to 4652 states and 6242 transitions. [2024-11-27 20:29:14,471 INFO L78 Accepts]: Start accepts. Automaton has 4652 states and 6242 transitions. Word has length 85 [2024-11-27 20:29:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:14,471 INFO L471 AbstractCegarLoop]: Abstraction has 4652 states and 6242 transitions. [2024-11-27 20:29:14,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-27 20:29:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4652 states and 6242 transitions. [2024-11-27 20:29:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-27 20:29:14,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:14,482 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:14,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 20:29:14,483 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2119107504, now seen corresponding path program 1 times [2024-11-27 20:29:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107505445] [2024-11-27 20:29:14,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:29:14,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:14,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107505445] [2024-11-27 20:29:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107505445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:14,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192121792] [2024-11-27 20:29:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:14,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:14,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:14,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:14,561 INFO L87 Difference]: Start difference. First operand 4652 states and 6242 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-27 20:29:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:14,915 INFO L93 Difference]: Finished difference Result 8876 states and 11898 transitions. [2024-11-27 20:29:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:14,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 112 [2024-11-27 20:29:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:14,931 INFO L225 Difference]: With dead ends: 8876 [2024-11-27 20:29:14,932 INFO L226 Difference]: Without dead ends: 4602 [2024-11-27 20:29:14,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:14,938 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 33 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:14,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2024-11-27 20:29:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602. [2024-11-27 20:29:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 4601 states have (on average 1.3344925016300804) internal successors, (6140), 4601 states have internal predecessors, (6140), 0 states have call successors, (0), 0 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-27 20:29:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6140 transitions. [2024-11-27 20:29:15,566 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6140 transitions. Word has length 112 [2024-11-27 20:29:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:15,568 INFO L471 AbstractCegarLoop]: Abstraction has 4602 states and 6140 transitions. [2024-11-27 20:29:15,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 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-27 20:29:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6140 transitions. [2024-11-27 20:29:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-27 20:29:15,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:15,582 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:15,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-27 20:29:15,583 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1525951332, now seen corresponding path program 1 times [2024-11-27 20:29:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664181197] [2024-11-27 20:29:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:29:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664181197] [2024-11-27 20:29:15,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664181197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:15,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:15,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630674155] [2024-11-27 20:29:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:15,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:15,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:15,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:15,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:15,770 INFO L87 Difference]: Start difference. First operand 4602 states and 6140 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-27 20:29:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:16,212 INFO L93 Difference]: Finished difference Result 8194 states and 10950 transitions. [2024-11-27 20:29:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:16,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 123 [2024-11-27 20:29:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:16,230 INFO L225 Difference]: With dead ends: 8194 [2024-11-27 20:29:16,230 INFO L226 Difference]: Without dead ends: 4528 [2024-11-27 20:29:16,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:16,235 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 294 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:16,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 297 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2024-11-27 20:29:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 4526. [2024-11-27 20:29:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4526 states, 4525 states have (on average 1.3093922651933703) internal successors, (5925), 4525 states have internal predecessors, (5925), 0 states have call successors, (0), 0 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-27 20:29:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 5925 transitions. [2024-11-27 20:29:16,601 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 5925 transitions. Word has length 123 [2024-11-27 20:29:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:16,604 INFO L471 AbstractCegarLoop]: Abstraction has 4526 states and 5925 transitions. [2024-11-27 20:29:16,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-27 20:29:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 5925 transitions. [2024-11-27 20:29:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-27 20:29:16,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:16,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:16,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 20:29:16,613 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:16,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:16,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2054556814, now seen corresponding path program 1 times [2024-11-27 20:29:16,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284930412] [2024-11-27 20:29:16,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:16,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-27 20:29:16,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284930412] [2024-11-27 20:29:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284930412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:16,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188104375] [2024-11-27 20:29:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:16,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:16,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:16,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:16,679 INFO L87 Difference]: Start difference. First operand 4526 states and 5925 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-27 20:29:16,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:16,996 INFO L93 Difference]: Finished difference Result 8655 states and 11324 transitions. [2024-11-27 20:29:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:16,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 129 [2024-11-27 20:29:16,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:17,009 INFO L225 Difference]: With dead ends: 8655 [2024-11-27 20:29:17,010 INFO L226 Difference]: Without dead ends: 4508 [2024-11-27 20:29:17,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:17,015 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 24 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:17,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 288 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2024-11-27 20:29:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 4488. [2024-11-27 20:29:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4488 states, 4487 states have (on average 1.3026521060842433) internal successors, (5845), 4487 states have internal predecessors, (5845), 0 states have call successors, (0), 0 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-27 20:29:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 5845 transitions. [2024-11-27 20:29:17,355 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 5845 transitions. Word has length 129 [2024-11-27 20:29:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:17,356 INFO L471 AbstractCegarLoop]: Abstraction has 4488 states and 5845 transitions. [2024-11-27 20:29:17,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-27 20:29:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 5845 transitions. [2024-11-27 20:29:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-27 20:29:17,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:17,364 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:17,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 20:29:17,366 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:17,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1276876354, now seen corresponding path program 1 times [2024-11-27 20:29:17,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:17,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595960696] [2024-11-27 20:29:17,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:17,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-27 20:29:17,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:17,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595960696] [2024-11-27 20:29:17,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595960696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:17,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:17,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32684041] [2024-11-27 20:29:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:17,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:17,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:17,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:17,437 INFO L87 Difference]: Start difference. First operand 4488 states and 5845 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-27 20:29:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:17,799 INFO L93 Difference]: Finished difference Result 8605 states and 11204 transitions. [2024-11-27 20:29:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 129 [2024-11-27 20:29:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:17,812 INFO L225 Difference]: With dead ends: 8605 [2024-11-27 20:29:17,812 INFO L226 Difference]: Without dead ends: 4478 [2024-11-27 20:29:17,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:17,817 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 20 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:17,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 287 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2024-11-27 20:29:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 4458. [2024-11-27 20:29:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4458 states, 4457 states have (on average 1.2954902400717971) internal successors, (5774), 4457 states have internal predecessors, (5774), 0 states have call successors, (0), 0 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-27 20:29:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4458 states to 4458 states and 5774 transitions. [2024-11-27 20:29:18,122 INFO L78 Accepts]: Start accepts. Automaton has 4458 states and 5774 transitions. Word has length 129 [2024-11-27 20:29:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:18,123 INFO L471 AbstractCegarLoop]: Abstraction has 4458 states and 5774 transitions. [2024-11-27 20:29:18,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-27 20:29:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4458 states and 5774 transitions. [2024-11-27 20:29:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-27 20:29:18,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:18,130 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:18,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 20:29:18,131 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:18,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:18,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2132572243, now seen corresponding path program 1 times [2024-11-27 20:29:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:18,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395638550] [2024-11-27 20:29:18,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-27 20:29:18,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395638550] [2024-11-27 20:29:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395638550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:18,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:18,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832947930] [2024-11-27 20:29:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:18,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:18,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:18,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:18,265 INFO L87 Difference]: Start difference. First operand 4458 states and 5774 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-27 20:29:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:18,516 INFO L93 Difference]: Finished difference Result 7249 states and 9422 transitions. [2024-11-27 20:29:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:18,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 132 [2024-11-27 20:29:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:18,526 INFO L225 Difference]: With dead ends: 7249 [2024-11-27 20:29:18,526 INFO L226 Difference]: Without dead ends: 3153 [2024-11-27 20:29:18,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:18,531 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 272 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:18,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 276 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2024-11-27 20:29:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 3151. [2024-11-27 20:29:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3151 states, 3150 states have (on average 1.2657142857142858) internal successors, (3987), 3150 states have internal predecessors, (3987), 0 states have call successors, (0), 0 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-27 20:29:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 3987 transitions. [2024-11-27 20:29:18,802 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 3987 transitions. Word has length 132 [2024-11-27 20:29:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:18,802 INFO L471 AbstractCegarLoop]: Abstraction has 3151 states and 3987 transitions. [2024-11-27 20:29:18,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-27 20:29:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 3987 transitions. [2024-11-27 20:29:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-27 20:29:18,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:18,807 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:18,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-27 20:29:18,807 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:18,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 8107751, now seen corresponding path program 1 times [2024-11-27 20:29:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476813653] [2024-11-27 20:29:18,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:18,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:29:18,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476813653] [2024-11-27 20:29:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476813653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669241342] [2024-11-27 20:29:18,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:18,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:18,952 INFO L87 Difference]: Start difference. First operand 3151 states and 3987 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-27 20:29:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:19,157 INFO L93 Difference]: Finished difference Result 5114 states and 6480 transitions. [2024-11-27 20:29:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:19,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 132 [2024-11-27 20:29:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:19,165 INFO L225 Difference]: With dead ends: 5114 [2024-11-27 20:29:19,166 INFO L226 Difference]: Without dead ends: 2031 [2024-11-27 20:29:19,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:19,169 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 275 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:19,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 261 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2024-11-27 20:29:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2029. [2024-11-27 20:29:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 2028 states have (on average 1.2268244575936884) internal successors, (2488), 2028 states have internal predecessors, (2488), 0 states have call successors, (0), 0 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-27 20:29:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2488 transitions. [2024-11-27 20:29:19,333 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2488 transitions. Word has length 132 [2024-11-27 20:29:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:19,333 INFO L471 AbstractCegarLoop]: Abstraction has 2029 states and 2488 transitions. [2024-11-27 20:29:19,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-27 20:29:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2488 transitions. [2024-11-27 20:29:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-27 20:29:19,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:19,336 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:19,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-27 20:29:19,336 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:19,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash -5339678, now seen corresponding path program 1 times [2024-11-27 20:29:19,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:19,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218143983] [2024-11-27 20:29:19,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:19,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-27 20:29:19,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:19,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218143983] [2024-11-27 20:29:19,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218143983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:19,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:19,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103094310] [2024-11-27 20:29:19,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:19,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:19,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:19,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:19,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:19,430 INFO L87 Difference]: Start difference. First operand 2029 states and 2488 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-27 20:29:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:19,596 INFO L93 Difference]: Finished difference Result 3667 states and 4531 transitions. [2024-11-27 20:29:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:19,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 169 [2024-11-27 20:29:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:19,604 INFO L225 Difference]: With dead ends: 3667 [2024-11-27 20:29:19,604 INFO L226 Difference]: Without dead ends: 1967 [2024-11-27 20:29:19,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:19,609 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:19,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 288 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2024-11-27 20:29:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1899. [2024-11-27 20:29:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1898 states have (on average 1.2118018967334037) internal successors, (2300), 1898 states have internal predecessors, (2300), 0 states have call successors, (0), 0 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-27 20:29:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2300 transitions. [2024-11-27 20:29:19,757 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2300 transitions. Word has length 169 [2024-11-27 20:29:19,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:19,758 INFO L471 AbstractCegarLoop]: Abstraction has 1899 states and 2300 transitions. [2024-11-27 20:29:19,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-27 20:29:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2300 transitions. [2024-11-27 20:29:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-27 20:29:19,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:19,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:19,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-27 20:29:19,761 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -812068322, now seen corresponding path program 1 times [2024-11-27 20:29:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897006772] [2024-11-27 20:29:19,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-27 20:29:19,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:19,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897006772] [2024-11-27 20:29:19,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897006772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:19,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:19,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014888062] [2024-11-27 20:29:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:19,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:19,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:19,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:19,827 INFO L87 Difference]: Start difference. First operand 1899 states and 2300 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-27 20:29:20,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:20,100 INFO L93 Difference]: Finished difference Result 4086 states and 4985 transitions. [2024-11-27 20:29:20,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:20,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 175 [2024-11-27 20:29:20,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:20,110 INFO L225 Difference]: With dead ends: 4086 [2024-11-27 20:29:20,110 INFO L226 Difference]: Without dead ends: 2512 [2024-11-27 20:29:20,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:20,113 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 137 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:20,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 286 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2024-11-27 20:29:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2171. [2024-11-27 20:29:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 2170 states have (on average 1.1953917050691245) internal successors, (2594), 2170 states have internal predecessors, (2594), 0 states have call successors, (0), 0 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-27 20:29:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2594 transitions. [2024-11-27 20:29:20,390 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2594 transitions. Word has length 175 [2024-11-27 20:29:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:20,391 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 2594 transitions. [2024-11-27 20:29:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-27 20:29:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2594 transitions. [2024-11-27 20:29:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-27 20:29:20,394 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:20,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:20,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-27 20:29:20,395 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:20,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash 949396395, now seen corresponding path program 1 times [2024-11-27 20:29:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888498741] [2024-11-27 20:29:20,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-27 20:29:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888498741] [2024-11-27 20:29:20,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888498741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:20,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:20,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805470670] [2024-11-27 20:29:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:20,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:20,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:20,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:20,492 INFO L87 Difference]: Start difference. First operand 2171 states and 2594 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-27 20:29:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:20,667 INFO L93 Difference]: Finished difference Result 3688 states and 4440 transitions. [2024-11-27 20:29:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:20,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 178 [2024-11-27 20:29:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:20,676 INFO L225 Difference]: With dead ends: 3688 [2024-11-27 20:29:20,676 INFO L226 Difference]: Without dead ends: 1840 [2024-11-27 20:29:20,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:20,680 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:20,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-11-27 20:29:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1762. [2024-11-27 20:29:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1761 states have (on average 1.1783077796706416) internal successors, (2075), 1761 states have internal predecessors, (2075), 0 states have call successors, (0), 0 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-27 20:29:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2075 transitions. [2024-11-27 20:29:20,841 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2075 transitions. Word has length 178 [2024-11-27 20:29:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:20,842 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2075 transitions. [2024-11-27 20:29:20,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-27 20:29:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2075 transitions. [2024-11-27 20:29:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-27 20:29:20,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:20,845 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-27 20:29:20,847 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:20,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash -375459799, now seen corresponding path program 1 times [2024-11-27 20:29:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:20,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938534194] [2024-11-27 20:29:20,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:20,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 20:29:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938534194] [2024-11-27 20:29:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938534194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:29:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160939302] [2024-11-27 20:29:21,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:21,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:29:21,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:29:21,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:29:21,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:29:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:21,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-27 20:29:21,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:29:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 71 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 20:29:22,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:29:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 71 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 20:29:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160939302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:29:23,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:29:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2024-11-27 20:29:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811139683] [2024-11-27 20:29:23,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:29:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-27 20:29:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:23,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-27 20:29:23,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2024-11-27 20:29:23,015 INFO L87 Difference]: Start difference. First operand 1762 states and 2075 transitions. Second operand has 27 states, 27 states have (on average 16.296296296296298) internal successors, (440), 27 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-27 20:29:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:25,410 INFO L93 Difference]: Finished difference Result 6327 states and 7452 transitions. [2024-11-27 20:29:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-27 20:29:25,411 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 16.296296296296298) internal successors, (440), 27 states have internal predecessors, (440), 0 states have call successors, (0), 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 178 [2024-11-27 20:29:25,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:25,423 INFO L225 Difference]: With dead ends: 6327 [2024-11-27 20:29:25,424 INFO L226 Difference]: Without dead ends: 4818 [2024-11-27 20:29:25,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=490, Invalid=3416, Unknown=0, NotChecked=0, Total=3906 [2024-11-27 20:29:25,429 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 2393 mSDsluCounter, 8152 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 8655 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:25,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 8655 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:29:25,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2024-11-27 20:29:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 2653. [2024-11-27 20:29:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2652 states have (on average 1.1787330316742082) internal successors, (3126), 2652 states have internal predecessors, (3126), 0 states have call successors, (0), 0 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-27 20:29:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3126 transitions. [2024-11-27 20:29:25,639 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3126 transitions. Word has length 178 [2024-11-27 20:29:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:25,639 INFO L471 AbstractCegarLoop]: Abstraction has 2653 states and 3126 transitions. [2024-11-27 20:29:25,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.296296296296298) internal successors, (440), 27 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-27 20:29:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3126 transitions. [2024-11-27 20:29:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-27 20:29:25,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:25,644 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:25,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:29:25,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-27 20:29:25,845 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:25,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash 817310514, now seen corresponding path program 1 times [2024-11-27 20:29:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:25,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858931840] [2024-11-27 20:29:25,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-27 20:29:25,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:25,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858931840] [2024-11-27 20:29:25,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858931840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:25,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482235990] [2024-11-27 20:29:25,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:25,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:25,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:25,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:25,943 INFO L87 Difference]: Start difference. First operand 2653 states and 3126 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-27 20:29:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:26,111 INFO L93 Difference]: Finished difference Result 4130 states and 4838 transitions. [2024-11-27 20:29:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:26,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 242 [2024-11-27 20:29:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:26,118 INFO L225 Difference]: With dead ends: 4130 [2024-11-27 20:29:26,118 INFO L226 Difference]: Without dead ends: 1774 [2024-11-27 20:29:26,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:26,120 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 3 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:26,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 298 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-27 20:29:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1741. [2024-11-27 20:29:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1740 states have (on average 1.1511494252873564) internal successors, (2003), 1740 states have internal predecessors, (2003), 0 states have call successors, (0), 0 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-27 20:29:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2003 transitions. [2024-11-27 20:29:26,271 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2003 transitions. Word has length 242 [2024-11-27 20:29:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:26,271 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2003 transitions. [2024-11-27 20:29:26,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-27 20:29:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2003 transitions. [2024-11-27 20:29:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-27 20:29:26,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:26,275 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:26,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-27 20:29:26,276 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:26,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1978570159, now seen corresponding path program 1 times [2024-11-27 20:29:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975521946] [2024-11-27 20:29:26,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-27 20:29:26,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:26,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975521946] [2024-11-27 20:29:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975521946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:26,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:26,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:29:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454358936] [2024-11-27 20:29:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:26,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:29:26,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:26,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:29:26,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:29:26,471 INFO L87 Difference]: Start difference. First operand 1741 states and 2003 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-27 20:29:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:26,667 INFO L93 Difference]: Finished difference Result 3231 states and 3723 transitions. [2024-11-27 20:29:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:29:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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 249 [2024-11-27 20:29:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:26,674 INFO L225 Difference]: With dead ends: 3231 [2024-11-27 20:29:26,674 INFO L226 Difference]: Without dead ends: 1742 [2024-11-27 20:29:26,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:29:26,676 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 180 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:26,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 207 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2024-11-27 20:29:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1741. [2024-11-27 20:29:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1740 states have (on average 1.1408045977011494) internal successors, (1985), 1740 states have internal predecessors, (1985), 0 states have call successors, (0), 0 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-27 20:29:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 1985 transitions. [2024-11-27 20:29:26,831 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 1985 transitions. Word has length 249 [2024-11-27 20:29:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:26,832 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 1985 transitions. [2024-11-27 20:29:26,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-27 20:29:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 1985 transitions. [2024-11-27 20:29:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-27 20:29:26,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:26,836 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:26,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-27 20:29:26,837 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:29:26,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -793602294, now seen corresponding path program 1 times [2024-11-27 20:29:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138848097] [2024-11-27 20:29:26,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:26,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-27 20:29:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:26,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138848097] [2024-11-27 20:29:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138848097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:26,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:26,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:29:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939496179] [2024-11-27 20:29:26,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:26,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:29:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:26,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:29:26,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:26,933 INFO L87 Difference]: Start difference. First operand 1741 states and 1985 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-27 20:29:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:27,020 INFO L93 Difference]: Finished difference Result 2000 states and 2269 transitions. [2024-11-27 20:29:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:29:27,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 251 [2024-11-27 20:29:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:27,023 INFO L225 Difference]: With dead ends: 2000 [2024-11-27 20:29:27,024 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 20:29:27,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:29:27,025 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 23 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:27,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 280 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:29:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 20:29:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 20:29:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-27 20:29:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 20:29:27,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 251 [2024-11-27 20:29:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:27,030 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 20:29:27,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-27 20:29:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 20:29:27,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 20:29:27,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:29:27,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-27 20:29:27,039 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:27,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-27 20:29:35,801 WARN L286 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 225 DAG size of output: 285 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-27 20:29:41,516 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 214 DAG size of output: 277 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-27 20:31:06,697 WARN L286 SmtUtils]: Spent 1.42m on a formula simplification. DAG size of input: 194 DAG size of output: 246 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-27 20:31:50,770 WARN L286 SmtUtils]: Spent 44.07s on a formula simplification. DAG size of input: 395 DAG size of output: 497 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-27 20:32:05,770 WARN L286 SmtUtils]: Spent 15.00s on a formula simplification. DAG size of input: 288 DAG size of output: 366 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-27 20:32:20,491 WARN L286 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 288 DAG size of output: 366 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-27 20:32:29,664 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 497 DAG size of output: 120 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-27 20:32:33,202 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:32:33,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:32:33 BoogieIcfgContainer [2024-11-27 20:32:33,294 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:32:33,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:32:33,295 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:32:33,295 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:32:33,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:29:01" (3/4) ... [2024-11-27 20:32:33,298 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 20:32:33,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-27 20:32:33,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-27 20:32:33,324 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-27 20:32:33,324 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 20:32:33,506 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 20:32:33,506 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 20:32:33,506 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:32:33,507 INFO L158 Benchmark]: Toolchain (without parser) took 212982.44ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 92.7MB in the beginning and 669.6MB in the end (delta: -576.9MB). Peak memory consumption was 849.0MB. Max. memory is 16.1GB. [2024-11-27 20:32:33,507 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:32:33,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.92ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 77.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:32:33,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.31ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:32:33,510 INFO L158 Benchmark]: Boogie Preprocessor took 46.11ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 73.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:32:33,510 INFO L158 Benchmark]: RCFGBuilder took 812.70ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 47.8MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:32:33,510 INFO L158 Benchmark]: TraceAbstraction took 211299.11ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 47.4MB in the beginning and 686.3MB in the end (delta: -639.0MB). Peak memory consumption was 888.3MB. Max. memory is 16.1GB. [2024-11-27 20:32:33,511 INFO L158 Benchmark]: Witness Printer took 210.99ms. Allocated memory is still 1.5GB. Free memory was 686.3MB in the beginning and 669.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:32:33,511 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.49ms. Allocated memory is still 117.4MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.92ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 77.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.31ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.11ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 73.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 812.70ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 47.8MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 211299.11ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 47.4MB in the beginning and 686.3MB in the end (delta: -639.0MB). Peak memory consumption was 888.3MB. Max. memory is 16.1GB. * Witness Printer took 210.99ms. Allocated memory is still 1.5GB. Free memory was 686.3MB in the beginning and 669.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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 - PositiveResult [Line: 23]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.0s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10121 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10121 mSDsluCounter, 19721 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12284 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1561 IncrementalHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 7437 mSDtfsCounter, 1561 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5180occurred in iteration=21, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 6275 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3444 NumberOfCodeBlocks, 3444 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3584 ConstructedInterpolants, 0 QuantifiedInterpolants, 7546 SizeOfPredicates, 5 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 38 InterpolantComputations, 35 PerfectInterpolantSequences, 1571/1678 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1)) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (((long long) t_b + 2) == c)) && (wb_st != 0)) && (c2_pc == 1)) && (((long long) t_b + 2) == c_t)) && (e_wl != 0)) && (wb_i == 1))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) - InvariantResult [Line: 152]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1)) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 87]: Location Invariant Derived location invariant: (((0 != wl_pc) && (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (((long long) t_b + 2) == c_t)) && (e_wl != 0)) && (wb_i == 1)) || (((((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || ((((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (data == t_b)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1)))) && (e_f == 2)) - InvariantResult [Line: 197]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1)) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 242]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1)) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (((long long) t_b + 2) == c_t)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1)) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (((long long) t_b + 2) == c)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (((long long) t_b + 2) == d)) && (((long long) t_b + 2) == c_t)) && (e_wl != 0)) && (2 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (((long long) t_b + 2) == c)) && (wb_st != 0)) && (c2_pc == 1)) && (((long long) t_b + 2) == c_t)) && (e_wl != 0)) && (wb_i == 1))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (((long long) t_b + 2) == c_t)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && ((((long long) t_b + 1) == d) || (((long long) t_b + 2) == d))) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (2 == wl_pc)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (data == t_b)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-27 20:32:33,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a32e313-d138-46b0-afa5-f240195e2cec/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE