./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label08.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_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/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_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label08.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/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_d27cb06d-d321-413f-859d-e3f83bf8e1b8/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 83003e08d0b0727d8396cfdc2be95d1bd0956c017aa98740983eff57678f4a43 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:07:37,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:07:37,369 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:07:37,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:07:37,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:07:37,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:07:37,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:07:37,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:07:37,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:07:37,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:07:37,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:07:37,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:07:37,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:07:37,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:07:37,420 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:07:37,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:07:37,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:07:37,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:07:37,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:07:37,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:07:37,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:07:37,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:07:37,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:07:37,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:07:37,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:07:37,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:07:37,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:07:37,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:07:37,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:07:37,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:07:37,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:07:37,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:07:37,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:37,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:07:37,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:07:37,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:07:37,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:07:37,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:37,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:07:37,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:07:37,425 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:07:37,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:07:37,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:07:37,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:07:37,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:07:37,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:07:37,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:07:37,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:07:37,426 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_d27cb06d-d321-413f-859d-e3f83bf8e1b8/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 -> 83003e08d0b0727d8396cfdc2be95d1bd0956c017aa98740983eff57678f4a43 [2024-11-28 02:07:37,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:07:37,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:07:37,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:07:37,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:07:37,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:07:37,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/eca-rers2012/Problem02_label08.c [2024-11-28 02:07:40,849 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/data/c418a4f13/64071d5f3ea940c1b6df0aae469d92d6/FLAG0e0e63f82 [2024-11-28 02:07:41,183 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:07:41,184 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/sv-benchmarks/c/eca-rers2012/Problem02_label08.c [2024-11-28 02:07:41,201 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/data/c418a4f13/64071d5f3ea940c1b6df0aae469d92d6/FLAG0e0e63f82 [2024-11-28 02:07:41,229 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/data/c418a4f13/64071d5f3ea940c1b6df0aae469d92d6 [2024-11-28 02:07:41,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:07:41,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:07:41,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:41,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:07:41,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:07:41,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c0f014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41, skipping insertion in model container [2024-11-28 02:07:41,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:07:41,626 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_d27cb06d-d321-413f-859d-e3f83bf8e1b8/sv-benchmarks/c/eca-rers2012/Problem02_label08.c[19283,19296] [2024-11-28 02:07:41,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:41,677 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:07:41,785 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_d27cb06d-d321-413f-859d-e3f83bf8e1b8/sv-benchmarks/c/eca-rers2012/Problem02_label08.c[19283,19296] [2024-11-28 02:07:41,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:41,822 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:07:41,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41 WrapperNode [2024-11-28 02:07:41,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:41,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:41,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:07:41,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:07:41,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,906 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-28 02:07:41,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:41,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:07:41,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:07:41,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:07:41,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 02:07:41,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:41,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:42,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:42,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:07:42,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:07:42,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:07:42,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:07:42,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (1/1) ... [2024-11-28 02:07:42,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:42,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:42,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:07:42,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:07:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:07:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:07:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:07:42,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:07:42,184 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:07:42,186 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:07:43,573 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-28 02:07:43,573 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:07:43,597 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:07:43,597 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:07:43,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:43 BoogieIcfgContainer [2024-11-28 02:07:43,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:07:43,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:07:43,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:07:43,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:07:43,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:07:41" (1/3) ... [2024-11-28 02:07:43,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f6b764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:43, skipping insertion in model container [2024-11-28 02:07:43,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:41" (2/3) ... [2024-11-28 02:07:43,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f6b764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:43, skipping insertion in model container [2024-11-28 02:07:43,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:43" (3/3) ... [2024-11-28 02:07:43,612 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label08.c [2024-11-28 02:07:43,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:07:43,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label08.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:07:43,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:07:43,737 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;@4faa77c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:07:43,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:07:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-28 02:07:43,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:43,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:43,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:43,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash -266760851, now seen corresponding path program 1 times [2024-11-28 02:07:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:43,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733640628] [2024-11-28 02:07:43,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:43,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:44,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733640628] [2024-11-28 02:07:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733640628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:44,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:44,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064470478] [2024-11-28 02:07:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:44,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:44,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:44,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:44,701 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 40.666666666666664) internal successors, (122), 2 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-28 02:07:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:45,751 INFO L93 Difference]: Finished difference Result 596 states and 1030 transitions. [2024-11-28 02:07:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 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 122 [2024-11-28 02:07:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:45,763 INFO L225 Difference]: With dead ends: 596 [2024-11-28 02:07:45,764 INFO L226 Difference]: Without dead ends: 305 [2024-11-28 02:07:45,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:45,770 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 122 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:45,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:07:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-28 02:07:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-28 02:07:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2024-11-28 02:07:45,845 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 122 [2024-11-28 02:07:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:45,846 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2024-11-28 02:07:45,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 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-28 02:07:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2024-11-28 02:07:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-28 02:07:45,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:45,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:45,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:07:45,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:45,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash -953262679, now seen corresponding path program 1 times [2024-11-28 02:07:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:45,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322209231] [2024-11-28 02:07:45,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322209231] [2024-11-28 02:07:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322209231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:46,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775231615] [2024-11-28 02:07:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:46,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:46,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:46,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:46,121 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:46,768 INFO L93 Difference]: Finished difference Result 900 states and 1374 transitions. [2024-11-28 02:07:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-28 02:07:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:46,772 INFO L225 Difference]: With dead ends: 900 [2024-11-28 02:07:46,772 INFO L226 Difference]: Without dead ends: 597 [2024-11-28 02:07:46,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:46,778 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:46,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 72 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:07:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-28 02:07:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 456. [2024-11-28 02:07:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 678 transitions. [2024-11-28 02:07:46,807 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 678 transitions. Word has length 133 [2024-11-28 02:07:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:46,808 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 678 transitions. [2024-11-28 02:07:46,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 678 transitions. [2024-11-28 02:07:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-28 02:07:46,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:46,811 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:46,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:07:46,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:46,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash 796838958, now seen corresponding path program 1 times [2024-11-28 02:07:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389171346] [2024-11-28 02:07:46,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:47,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389171346] [2024-11-28 02:07:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389171346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:47,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:47,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446299397] [2024-11-28 02:07:47,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:47,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:47,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:47,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:47,068 INFO L87 Difference]: Start difference. First operand 456 states and 678 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:47,674 INFO L93 Difference]: Finished difference Result 1352 states and 2016 transitions. [2024-11-28 02:07:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-11-28 02:07:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:47,678 INFO L225 Difference]: With dead ends: 1352 [2024-11-28 02:07:47,678 INFO L226 Difference]: Without dead ends: 898 [2024-11-28 02:07:47,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:47,680 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:47,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 123 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:07:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-28 02:07:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 889. [2024-11-28 02:07:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1278 transitions. [2024-11-28 02:07:47,718 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1278 transitions. Word has length 140 [2024-11-28 02:07:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:47,718 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1278 transitions. [2024-11-28 02:07:47,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1278 transitions. [2024-11-28 02:07:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-28 02:07:47,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:47,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:47,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:07:47,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2093077735, now seen corresponding path program 1 times [2024-11-28 02:07:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461276262] [2024-11-28 02:07:47,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:47,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:47,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461276262] [2024-11-28 02:07:47,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461276262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:47,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973352106] [2024-11-28 02:07:47,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:47,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:47,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:47,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:47,959 INFO L87 Difference]: Start difference. First operand 889 states and 1278 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:48,587 INFO L93 Difference]: Finished difference Result 2619 states and 3774 transitions. [2024-11-28 02:07:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:48,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-11-28 02:07:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:48,594 INFO L225 Difference]: With dead ends: 2619 [2024-11-28 02:07:48,594 INFO L226 Difference]: Without dead ends: 1732 [2024-11-28 02:07:48,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:48,596 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 153 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:48,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 76 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:07:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2024-11-28 02:07:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1452. [2024-11-28 02:07:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 1.377670572019297) internal successors, (1999), 1451 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1999 transitions. [2024-11-28 02:07:48,641 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1999 transitions. Word has length 144 [2024-11-28 02:07:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:48,642 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 1999 transitions. [2024-11-28 02:07:48,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1999 transitions. [2024-11-28 02:07:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-28 02:07:48,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:48,647 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:07:48,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash 594620078, now seen corresponding path program 1 times [2024-11-28 02:07:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:48,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114902396] [2024-11-28 02:07:48,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-28 02:07:48,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:48,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114902396] [2024-11-28 02:07:48,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114902396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:48,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:48,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:48,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558266871] [2024-11-28 02:07:48,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:48,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:48,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:48,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:48,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:48,772 INFO L87 Difference]: Start difference. First operand 1452 states and 1999 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:49,361 INFO L93 Difference]: Finished difference Result 2761 states and 3780 transitions. [2024-11-28 02:07:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 149 [2024-11-28 02:07:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:49,366 INFO L225 Difference]: With dead ends: 2761 [2024-11-28 02:07:49,367 INFO L226 Difference]: Without dead ends: 1311 [2024-11-28 02:07:49,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:49,371 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 161 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:49,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 272 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:07:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2024-11-28 02:07:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1303. [2024-11-28 02:07:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1302 states have (on average 1.2972350230414746) internal successors, (1689), 1302 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1689 transitions. [2024-11-28 02:07:49,413 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1689 transitions. Word has length 149 [2024-11-28 02:07:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:49,414 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1689 transitions. [2024-11-28 02:07:49,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1689 transitions. [2024-11-28 02:07:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-28 02:07:49,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:49,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:49,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:07:49,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:49,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1721690927, now seen corresponding path program 1 times [2024-11-28 02:07:49,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:49,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410493697] [2024-11-28 02:07:49,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 02:07:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:49,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410493697] [2024-11-28 02:07:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410493697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:49,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575002248] [2024-11-28 02:07:49,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:49,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:49,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:49,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:49,718 INFO L87 Difference]: Start difference. First operand 1303 states and 1689 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:50,394 INFO L93 Difference]: Finished difference Result 3736 states and 4831 transitions. [2024-11-28 02:07:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 149 [2024-11-28 02:07:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:50,404 INFO L225 Difference]: With dead ends: 3736 [2024-11-28 02:07:50,404 INFO L226 Difference]: Without dead ends: 2435 [2024-11-28 02:07:50,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:50,407 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:50,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 281 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:07:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2024-11-28 02:07:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2433. [2024-11-28 02:07:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2432 states have (on average 1.2125822368421053) internal successors, (2949), 2432 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 2949 transitions. [2024-11-28 02:07:50,466 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 2949 transitions. Word has length 149 [2024-11-28 02:07:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:50,466 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 2949 transitions. [2024-11-28 02:07:50,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2949 transitions. [2024-11-28 02:07:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-28 02:07:50,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:50,473 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2024-11-28 02:07:50,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:07:50,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:50,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:50,474 INFO L85 PathProgramCache]: Analyzing trace with hash 455447727, now seen corresponding path program 1 times [2024-11-28 02:07:50,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:50,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566858644] [2024-11-28 02:07:50,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:50,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566858644] [2024-11-28 02:07:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566858644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096746797] [2024-11-28 02:07:50,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:50,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:07:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:50,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:07:50,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:07:50,944 INFO L87 Difference]: Start difference. First operand 2433 states and 2949 transitions. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:52,115 INFO L93 Difference]: Finished difference Result 5978 states and 7324 transitions. [2024-11-28 02:07:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:07:52,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2024-11-28 02:07:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:52,125 INFO L225 Difference]: With dead ends: 5978 [2024-11-28 02:07:52,125 INFO L226 Difference]: Without dead ends: 2987 [2024-11-28 02:07:52,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:52,129 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 294 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:52,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 143 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 02:07:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2024-11-28 02:07:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2987. [2024-11-28 02:07:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2986 states have (on average 1.1302746148693905) internal successors, (3375), 2986 states have internal predecessors, (3375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3375 transitions. [2024-11-28 02:07:52,218 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3375 transitions. Word has length 193 [2024-11-28 02:07:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:52,218 INFO L471 AbstractCegarLoop]: Abstraction has 2987 states and 3375 transitions. [2024-11-28 02:07:52,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3375 transitions. [2024-11-28 02:07:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-28 02:07:52,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:52,226 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:52,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:07:52,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1252570470, now seen corresponding path program 1 times [2024-11-28 02:07:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918444420] [2024-11-28 02:07:52,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 02:07:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918444420] [2024-11-28 02:07:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918444420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346102580] [2024-11-28 02:07:52,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:52,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:52,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:52,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:52,446 INFO L87 Difference]: Start difference. First operand 2987 states and 3375 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:53,021 INFO L93 Difference]: Finished difference Result 6664 states and 7555 transitions. [2024-11-28 02:07:53,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:53,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 215 [2024-11-28 02:07:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:53,032 INFO L225 Difference]: With dead ends: 6664 [2024-11-28 02:07:53,032 INFO L226 Difference]: Without dead ends: 2556 [2024-11-28 02:07:53,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:53,037 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:53,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 243 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:07:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-11-28 02:07:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2556. [2024-11-28 02:07:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2555 states have (on average 1.0876712328767124) internal successors, (2779), 2555 states have internal predecessors, (2779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 2779 transitions. [2024-11-28 02:07:53,110 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 2779 transitions. Word has length 215 [2024-11-28 02:07:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:53,111 INFO L471 AbstractCegarLoop]: Abstraction has 2556 states and 2779 transitions. [2024-11-28 02:07:53,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 2779 transitions. [2024-11-28 02:07:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-28 02:07:53,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:53,121 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:53,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:07:53,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:53,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash -5826163, now seen corresponding path program 1 times [2024-11-28 02:07:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390035398] [2024-11-28 02:07:53,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-28 02:07:53,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:53,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390035398] [2024-11-28 02:07:53,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390035398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:53,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:53,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463792973] [2024-11-28 02:07:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:53,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:53,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:53,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:53,297 INFO L87 Difference]: Start difference. First operand 2556 states and 2779 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:53,792 INFO L93 Difference]: Finished difference Result 4960 states and 5389 transitions. [2024-11-28 02:07:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:53,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 224 [2024-11-28 02:07:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:53,799 INFO L225 Difference]: With dead ends: 4960 [2024-11-28 02:07:53,799 INFO L226 Difference]: Without dead ends: 1706 [2024-11-28 02:07:53,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:53,803 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 124 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:53,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 211 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:07:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-11-28 02:07:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2024-11-28 02:07:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.0551319648093842) internal successors, (1799), 1705 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 1799 transitions. [2024-11-28 02:07:53,843 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 1799 transitions. Word has length 224 [2024-11-28 02:07:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:53,843 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 1799 transitions. [2024-11-28 02:07:53,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 1799 transitions. [2024-11-28 02:07:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-28 02:07:53,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:53,848 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:53,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:07:53,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:53,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1844788643, now seen corresponding path program 1 times [2024-11-28 02:07:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:53,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264633234] [2024-11-28 02:07:53,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-28 02:07:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:54,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264633234] [2024-11-28 02:07:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264633234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816557740] [2024-11-28 02:07:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:54,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:54,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:54,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:54,050 INFO L87 Difference]: Start difference. First operand 1706 states and 1799 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:54,520 INFO L93 Difference]: Finished difference Result 3551 states and 3738 transitions. [2024-11-28 02:07:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:54,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-11-28 02:07:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:54,527 INFO L225 Difference]: With dead ends: 3551 [2024-11-28 02:07:54,527 INFO L226 Difference]: Without dead ends: 1707 [2024-11-28 02:07:54,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:54,529 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 114 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:54,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 216 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:07:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-28 02:07:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1566. [2024-11-28 02:07:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.0485623003194888) internal successors, (1641), 1565 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1641 transitions. [2024-11-28 02:07:54,577 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 1641 transitions. Word has length 229 [2024-11-28 02:07:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:54,578 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 1641 transitions. [2024-11-28 02:07:54,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1641 transitions. [2024-11-28 02:07:54,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-28 02:07:54,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:54,583 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:54,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:07:54,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:54,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash -568698811, now seen corresponding path program 1 times [2024-11-28 02:07:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:54,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589636436] [2024-11-28 02:07:54,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-28 02:07:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:54,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589636436] [2024-11-28 02:07:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589636436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:54,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194783212] [2024-11-28 02:07:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:54,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:54,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:54,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:54,786 INFO L87 Difference]: Start difference. First operand 1566 states and 1641 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:55,267 INFO L93 Difference]: Finished difference Result 3831 states and 4023 transitions. [2024-11-28 02:07:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:55,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 250 [2024-11-28 02:07:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:55,275 INFO L225 Difference]: With dead ends: 3831 [2024-11-28 02:07:55,275 INFO L226 Difference]: Without dead ends: 2124 [2024-11-28 02:07:55,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:55,277 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:55,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 202 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:07:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2024-11-28 02:07:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2124. [2024-11-28 02:07:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2123 states have (on average 1.0414507772020725) internal successors, (2211), 2123 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2211 transitions. [2024-11-28 02:07:55,323 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2211 transitions. Word has length 250 [2024-11-28 02:07:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:55,323 INFO L471 AbstractCegarLoop]: Abstraction has 2124 states and 2211 transitions. [2024-11-28 02:07:55,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2211 transitions. [2024-11-28 02:07:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-28 02:07:55,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:55,341 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:55,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:07:55,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:55,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1757893682, now seen corresponding path program 1 times [2024-11-28 02:07:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:55,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133750140] [2024-11-28 02:07:55,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133750140] [2024-11-28 02:07:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133750140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880867552] [2024-11-28 02:07:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:55,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:55,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:55,789 INFO L87 Difference]: Start difference. First operand 2124 states and 2211 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:56,319 INFO L93 Difference]: Finished difference Result 4247 states and 4421 transitions. [2024-11-28 02:07:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:56,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2024-11-28 02:07:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:56,326 INFO L225 Difference]: With dead ends: 4247 [2024-11-28 02:07:56,327 INFO L226 Difference]: Without dead ends: 2125 [2024-11-28 02:07:56,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:56,329 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 88 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:56,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 217 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:07:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2024-11-28 02:07:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2122. [2024-11-28 02:07:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 1.0400754361150402) internal successors, (2206), 2121 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2206 transitions. [2024-11-28 02:07:56,378 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2206 transitions. Word has length 273 [2024-11-28 02:07:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:56,382 INFO L471 AbstractCegarLoop]: Abstraction has 2122 states and 2206 transitions. [2024-11-28 02:07:56,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2206 transitions. [2024-11-28 02:07:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-28 02:07:56,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:56,389 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:56,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:07:56,389 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:56,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:56,390 INFO L85 PathProgramCache]: Analyzing trace with hash 504030047, now seen corresponding path program 1 times [2024-11-28 02:07:56,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:56,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918739621] [2024-11-28 02:07:56,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-28 02:07:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918739621] [2024-11-28 02:07:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918739621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:56,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:56,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:56,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950201202] [2024-11-28 02:07:56,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:56,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:56,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:56,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:56,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:56,601 INFO L87 Difference]: Start difference. First operand 2122 states and 2206 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:57,036 INFO L93 Difference]: Finished difference Result 3106 states and 3227 transitions. [2024-11-28 02:07:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:57,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 306 [2024-11-28 02:07:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:57,037 INFO L225 Difference]: With dead ends: 3106 [2024-11-28 02:07:57,037 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 02:07:57,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:57,041 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 140 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:57,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 24 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:07:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 02:07:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 02:07:57,042 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-28 02:07:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 02:07:57,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 306 [2024-11-28 02:07:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:57,042 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 02:07:57,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 02:07:57,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 02:07:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 02:07:57,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:07:57,049 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:57,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-28 02:07:57,541 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:07:57,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:07:57 BoogieIcfgContainer [2024-11-28 02:07:57,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:07:57,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:07:57,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:07:57,571 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:07:57,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:43" (3/4) ... [2024-11-28 02:07:57,577 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 02:07:57,601 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-28 02:07:57,605 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-28 02:07:57,606 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 02:07:57,606 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 02:07:57,770 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 02:07:57,770 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 02:07:57,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:07:57,771 INFO L158 Benchmark]: Toolchain (without parser) took 16538.11ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 116.0MB in the beginning and 111.6MB in the end (delta: 4.4MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2024-11-28 02:07:57,773 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:57,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.25ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 89.6MB in the end (delta: 26.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:07:57,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.12ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 84.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:07:57,774 INFO L158 Benchmark]: Boogie Preprocessor took 112.93ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 79.5MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:57,775 INFO L158 Benchmark]: RCFGBuilder took 1576.73ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 69.1MB in the end (delta: 10.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-28 02:07:57,775 INFO L158 Benchmark]: TraceAbstraction took 13969.89ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 68.5MB in the beginning and 123.5MB in the end (delta: -55.0MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2024-11-28 02:07:57,776 INFO L158 Benchmark]: Witness Printer took 199.47ms. Allocated memory is still 268.4MB. Free memory was 123.5MB in the beginning and 111.6MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:07:57,778 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 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.25ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 89.6MB in the end (delta: 26.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.12ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 84.5MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.93ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 79.5MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1576.73ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 69.1MB in the end (delta: 10.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13969.89ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 68.5MB in the beginning and 123.5MB in the end (delta: -55.0MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * Witness Printer took 199.47ms. Allocated memory is still 268.4MB. Free memory was 123.5MB in the beginning and 111.6MB in the end (delta: 11.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: 548]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1791 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1791 mSDsluCounter, 2169 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 756 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5347 IncrementalHoareTripleChecker+Invalid, 6103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 756 mSolverCounterUnsat, 1902 mSDtfsCounter, 5347 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2987occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 584 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2527 NumberOfCodeBlocks, 2527 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2514 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 1459/1459 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: 616]: Loop Invariant Derived loop invariant: (((((((((((((((((((a17 == 8) && (a25 == 1)) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) || ((((((a17 == 8) && (a28 <= 9)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1))) || ((((((a17 == 8) && (a28 <= 9)) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1)) && (a25 <= 0))) || ((((a19 == 0) && (a28 <= 9)) && (a11 <= 0)) && (a25 <= 0))) || (((a19 == 0) && (a17 <= 7)) && (a25 <= 0))) || ((((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1))) || ((((a19 == 0) && (a25 == 1)) && (a28 <= 9)) && (a11 == 1))) || ((((a25 == 1) && (a28 <= 9)) && (a11 <= 0)) && (a19 == 1))) || (((((a19 == 0) && (9 <= a28)) && (a25 == 1)) && (a11 <= 0)) && (a28 <= 10))) || (((a28 <= 9) && (a17 <= 7)) && (a25 <= 0))) || ((((a19 == 0) && (a28 <= 9)) && (a11 == 1)) && (a25 <= 0))) || (((a25 == 1) && (a17 <= 7)) && (a11 <= 0))) || (((a25 == 1) && (a28 <= 9)) && (a17 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-28 02:07:57,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d27cb06d-d321-413f-859d-e3f83bf8e1b8/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