./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:19:46,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:19:46,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:19:46,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:19:46,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:19:46,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:19:46,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:19:46,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:19:46,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:19:46,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:19:46,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:19:46,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:19:46,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:19:46,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:19:46,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:19:46,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:19:46,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:19:46,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:19:46,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:19:46,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:19:46,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:19:46,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:19:46,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:19:46,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:19:46,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:19:46,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:19:46,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:19:46,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:19:46,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:19:46,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:19:46,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:19:46,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:19:46,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:19:46,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:19:46,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:19:46,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:19:46,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:19:46,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:19:46,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:19:46,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:19:46,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:19:46,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:19:46,385 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2024-11-19 05:19:46,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:19:46,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:19:46,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:19:46,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:19:46,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:19:46,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-11-19 05:19:48,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:19:48,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:19:48,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-11-19 05:19:48,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a09c676b/54e236aefb294637a5845758fa4eb34f/FLAGd3243f858 [2024-11-19 05:19:48,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a09c676b/54e236aefb294637a5845758fa4eb34f [2024-11-19 05:19:48,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:19:48,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:19:48,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:19:48,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:19:48,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:19:48,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:19:48" (1/1) ... [2024-11-19 05:19:48,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdbce44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:48, skipping insertion in model container [2024-11-19 05:19:48,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:19:48" (1/1) ... [2024-11-19 05:19:48,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:19:49,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i[37019,37032] [2024-11-19 05:19:49,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i[47352,47365] [2024-11-19 05:19:49,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:19:49,166 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:19:49,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i[37019,37032] [2024-11-19 05:19:49,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i[47352,47365] [2024-11-19 05:19:49,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:19:49,373 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:19:49,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49 WrapperNode [2024-11-19 05:19:49,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:19:49,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:19:49,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:19:49,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:19:49,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,427 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,576 INFO L138 Inliner]: procedures = 208, calls = 278, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1468 [2024-11-19 05:19:49,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:19:49,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:19:49,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:19:49,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:19:49,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,698 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-19 05:19:49,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:19:49,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:19:49,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:19:49,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:19:49,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (1/1) ... [2024-11-19 05:19:49,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:19:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:19:49,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:19:49,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:19:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:19:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:19:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 05:19:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 05:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 05:19:49,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:19:50,150 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:19:50,152 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:19:51,639 INFO L? ?]: Removed 329 outVars from TransFormulas that were not future-live. [2024-11-19 05:19:51,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:19:51,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:19:51,668 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 05:19:51,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:51 BoogieIcfgContainer [2024-11-19 05:19:51,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:19:51,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:19:51,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:19:51,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:19:51,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:19:48" (1/3) ... [2024-11-19 05:19:51,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db78ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:19:51, skipping insertion in model container [2024-11-19 05:19:51,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:19:49" (2/3) ... [2024-11-19 05:19:51,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db78ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:19:51, skipping insertion in model container [2024-11-19 05:19:51,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:19:51" (3/3) ... [2024-11-19 05:19:51,678 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-2.i [2024-11-19 05:19:51,692 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:19:51,692 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 05:19:51,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:19:51,776 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;@3dc34636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:19:51,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 05:19:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 416 states, 403 states have (on average 1.6228287841191067) internal successors, (654), 410 states have internal predecessors, (654), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:19:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 05:19:51,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:19:51,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:19:51,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:19:51,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:19:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1749664919, now seen corresponding path program 1 times [2024-11-19 05:19:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:19:51,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763879136] [2024-11-19 05:19:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:19:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:19:51,987 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-19 05:19:51,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:19:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763879136] [2024-11-19 05:19:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763879136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:19:51,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:19:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:19:51,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677929300] [2024-11-19 05:19:51,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:19:51,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:19:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:19:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:19:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:19:52,029 INFO L87 Difference]: Start difference. First operand has 416 states, 403 states have (on average 1.6228287841191067) internal successors, (654), 410 states have internal predecessors, (654), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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-19 05:19:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:19:52,113 INFO L93 Difference]: Finished difference Result 830 states and 1343 transitions. [2024-11-19 05:19:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:19:52,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-19 05:19:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:19:52,135 INFO L225 Difference]: With dead ends: 830 [2024-11-19 05:19:52,136 INFO L226 Difference]: Without dead ends: 377 [2024-11-19 05:19:52,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:19:52,147 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:19:52,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:19:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-19 05:19:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-19 05:19:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.4602739726027398) internal successors, (533), 371 states have internal predecessors, (533), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:19:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 549 transitions. [2024-11-19 05:19:52,289 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 549 transitions. Word has length 9 [2024-11-19 05:19:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:19:52,291 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 549 transitions. [2024-11-19 05:19:52,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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-19 05:19:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 549 transitions. [2024-11-19 05:19:52,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 05:19:52,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:19:52,297 INFO L215 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] [2024-11-19 05:19:52,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:19:52,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:19:52,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:19:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2144728515, now seen corresponding path program 1 times [2024-11-19 05:19:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:19:52,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590104331] [2024-11-19 05:19:52,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:19:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:19:52,831 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-19 05:19:52,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:19:52,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590104331] [2024-11-19 05:19:52,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590104331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:19:52,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:19:52,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:19:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847683744] [2024-11-19 05:19:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:19:52,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:19:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:19:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:19:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:19:52,838 INFO L87 Difference]: Start difference. First operand 377 states and 549 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-19 05:19:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:19:53,008 INFO L93 Difference]: Finished difference Result 917 states and 1346 transitions. [2024-11-19 05:19:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:19:53,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-19 05:19:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:19:53,013 INFO L225 Difference]: With dead ends: 917 [2024-11-19 05:19:53,013 INFO L226 Difference]: Without dead ends: 741 [2024-11-19 05:19:53,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:19:53,016 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 518 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:19:53,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1669 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:19:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-19 05:19:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 379. [2024-11-19 05:19:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 367 states have (on average 1.457765667574932) internal successors, (535), 373 states have internal predecessors, (535), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:19:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 551 transitions. [2024-11-19 05:19:53,049 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 551 transitions. Word has length 64 [2024-11-19 05:19:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:19:53,050 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 551 transitions. [2024-11-19 05:19:53,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-19 05:19:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 551 transitions. [2024-11-19 05:19:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 05:19:53,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:19:53,056 INFO L215 NwaCegarLoop]: trace histogram [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, 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-19 05:19:53,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:19:53,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:19:53,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:19:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash 799714340, now seen corresponding path program 1 times [2024-11-19 05:19:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:19:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428396220] [2024-11-19 05:19:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:19:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:19:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:19:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:19:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428396220] [2024-11-19 05:19:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428396220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:19:53,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:19:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:19:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147222564] [2024-11-19 05:19:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:19:53,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:19:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:19:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:19:53,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:19:53,537 INFO L87 Difference]: Start difference. First operand 379 states and 551 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 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-19 05:19:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:19:53,642 INFO L93 Difference]: Finished difference Result 712 states and 1032 transitions. [2024-11-19 05:19:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:19:53,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 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-19 05:19:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:19:53,647 INFO L225 Difference]: With dead ends: 712 [2024-11-19 05:19:53,647 INFO L226 Difference]: Without dead ends: 337 [2024-11-19 05:19:53,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:19:53,650 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 30 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:19:53,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1322 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:19:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-19 05:19:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-11-19 05:19:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.4092307692307693) internal successors, (458), 331 states have internal predecessors, (458), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:19:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 474 transitions. [2024-11-19 05:19:53,677 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 474 transitions. Word has length 140 [2024-11-19 05:19:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:19:53,678 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 474 transitions. [2024-11-19 05:19:53,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 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-19 05:19:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 474 transitions. [2024-11-19 05:19:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 05:19:53,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:19:53,687 INFO L215 NwaCegarLoop]: trace histogram [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, 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-19 05:19:53,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:19:53,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:19:53,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:19:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1221731408, now seen corresponding path program 1 times [2024-11-19 05:19:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:19:53,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653968381] [2024-11-19 05:19:53,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:19:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:19:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:19:53,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:19:53,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653968381] [2024-11-19 05:19:53,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653968381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:19:53,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:19:53,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:19:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392586223] [2024-11-19 05:19:53,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:19:53,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:19:53,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:19:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:19:53,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:19:53,923 INFO L87 Difference]: Start difference. First operand 337 states and 474 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-19 05:19:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:19:53,992 INFO L93 Difference]: Finished difference Result 905 states and 1288 transitions. [2024-11-19 05:19:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:19:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-19 05:19:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:19:53,996 INFO L225 Difference]: With dead ends: 905 [2024-11-19 05:19:53,999 INFO L226 Difference]: Without dead ends: 572 [2024-11-19 05:19:54,001 INFO L431 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-19 05:19:54,002 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 271 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:19:54,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1113 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:19:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-19 05:19:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 570. [2024-11-19 05:19:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 553 states have (on average 1.426763110307414) internal successors, (789), 564 states have internal predecessors, (789), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 05:19:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 815 transitions. [2024-11-19 05:19:54,030 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 815 transitions. Word has length 140 [2024-11-19 05:19:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:19:54,030 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 815 transitions. [2024-11-19 05:19:54,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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-19 05:19:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 815 transitions. [2024-11-19 05:19:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:19:54,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:19:54,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:19:54,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:19:54,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:19:54,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:19:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1633621304, now seen corresponding path program 1 times [2024-11-19 05:19:54,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:19:54,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296083086] [2024-11-19 05:19:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:19:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:19:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 05:19:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:19:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296083086] [2024-11-19 05:19:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296083086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:19:54,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:19:54,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:19:54,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360678432] [2024-11-19 05:19:54,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:19:54,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:19:54,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:19:54,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:19:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:19:54,436 INFO L87 Difference]: Start difference. First operand 570 states and 815 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:19:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:19:54,533 INFO L93 Difference]: Finished difference Result 807 states and 1165 transitions. [2024-11-19 05:19:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:19:54,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-19 05:19:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:19:54,538 INFO L225 Difference]: With dead ends: 807 [2024-11-19 05:19:54,540 INFO L226 Difference]: Without dead ends: 486 [2024-11-19 05:19:54,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:19:54,541 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 30 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:19:54,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1073 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:19:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-19 05:19:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2024-11-19 05:19:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 469 states have (on average 1.3539445628997868) internal successors, (635), 480 states have internal predecessors, (635), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 05:19:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 661 transitions. [2024-11-19 05:19:54,561 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 661 transitions. Word has length 155 [2024-11-19 05:19:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:19:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 661 transitions. [2024-11-19 05:19:54,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:19:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 661 transitions. [2024-11-19 05:19:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:19:54,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:19:54,566 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:19:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:19:54,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:19:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:19:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1489831868, now seen corresponding path program 1 times [2024-11-19 05:19:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:19:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899479538] [2024-11-19 05:19:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:19:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:19:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:19:54,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:19:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899479538] [2024-11-19 05:19:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899479538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:19:54,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:19:54,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:19:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621086333] [2024-11-19 05:19:54,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:19:54,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:19:54,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:19:54,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:19:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:19:54,906 INFO L87 Difference]: Start difference. First operand 486 states and 661 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:19:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:19:55,239 INFO L93 Difference]: Finished difference Result 960 states and 1306 transitions. [2024-11-19 05:19:55,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:19:55,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-19 05:19:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:19:55,243 INFO L225 Difference]: With dead ends: 960 [2024-11-19 05:19:55,243 INFO L226 Difference]: Without dead ends: 565 [2024-11-19 05:19:55,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:19:55,245 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 1182 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:19:55,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 920 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:19:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-19 05:19:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 382. [2024-11-19 05:19:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 370 states have (on average 1.3432432432432433) internal successors, (497), 376 states have internal predecessors, (497), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:19:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 513 transitions. [2024-11-19 05:19:55,260 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 513 transitions. Word has length 155 [2024-11-19 05:19:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:19:55,261 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 513 transitions. [2024-11-19 05:19:55,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:19:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 513 transitions. [2024-11-19 05:19:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 05:19:55,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:19:55,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:19:55,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:19:55,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:19:55,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:19:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1619982960, now seen corresponding path program 1 times [2024-11-19 05:19:55,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:19:55,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551496612] [2024-11-19 05:19:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:19:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:19:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:19:56,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:19:56,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551496612] [2024-11-19 05:19:56,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551496612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:19:56,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666355968] [2024-11-19 05:19:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:56,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:19:56,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:19:56,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:19:56,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:19:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:19:56,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 05:19:56,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:19:56,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 05:19:56,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:19:56,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:19:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:19:56,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:19:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:19:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666355968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:19:57,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:19:57,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2024-11-19 05:19:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098195386] [2024-11-19 05:19:57,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:19:57,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:19:57,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:19:57,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:19:57,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 05:19:57,127 INFO L87 Difference]: Start difference. First operand 382 states and 513 transitions. Second operand has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:19:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:19:57,480 INFO L93 Difference]: Finished difference Result 1265 states and 1709 transitions. [2024-11-19 05:19:57,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:19:57,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 165 [2024-11-19 05:19:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:19:57,486 INFO L225 Difference]: With dead ends: 1265 [2024-11-19 05:19:57,486 INFO L226 Difference]: Without dead ends: 1131 [2024-11-19 05:19:57,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-19 05:19:57,488 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 1713 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:19:57,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 3171 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:19:57,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-19 05:19:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 729. [2024-11-19 05:19:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 713 states have (on average 1.338008415147265) internal successors, (954), 719 states have internal predecessors, (954), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 05:19:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 976 transitions. [2024-11-19 05:19:57,523 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 976 transitions. Word has length 165 [2024-11-19 05:19:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:19:57,524 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 976 transitions. [2024-11-19 05:19:57,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:19:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2024-11-19 05:19:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-19 05:19:57,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:19:57,531 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:19:57,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 05:19:57,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:19:57,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:19:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:19:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash 95313527, now seen corresponding path program 1 times [2024-11-19 05:19:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:19:57,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784517813] [2024-11-19 05:19:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:19:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:19:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:01,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:01,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784517813] [2024-11-19 05:20:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784517813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:20:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199281215] [2024-11-19 05:20:01,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:01,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:20:01,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:20:01,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:20:01,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:20:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:02,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 05:20:02,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:20:02,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 05:20:03,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:20:03,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:20:03,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:20:03,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-19 05:20:03,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 05:20:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:03,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:20:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:20:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199281215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:20:04,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:20:04,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2024-11-19 05:20:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733676091] [2024-11-19 05:20:04,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:20:04,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 05:20:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:04,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 05:20:04,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2024-11-19 05:20:04,101 INFO L87 Difference]: Start difference. First operand 729 states and 976 transitions. Second operand has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:20:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:04,786 INFO L93 Difference]: Finished difference Result 2510 states and 3398 transitions. [2024-11-19 05:20:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 05:20:04,787 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 393 [2024-11-19 05:20:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:04,797 INFO L225 Difference]: With dead ends: 2510 [2024-11-19 05:20:04,798 INFO L226 Difference]: Without dead ends: 2376 [2024-11-19 05:20:04,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 778 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2024-11-19 05:20:04,799 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 3530 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3567 SdHoareTripleChecker+Valid, 5281 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:04,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3567 Valid, 5281 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:20:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2024-11-19 05:20:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1593. [2024-11-19 05:20:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1571 states have (on average 1.336728198599618) internal successors, (2100), 1577 states have internal predecessors, (2100), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:20:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2134 transitions. [2024-11-19 05:20:04,880 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2134 transitions. Word has length 393 [2024-11-19 05:20:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:04,881 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2134 transitions. [2024-11-19 05:20:04,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 05:20:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2134 transitions. [2024-11-19 05:20:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-19 05:20:04,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:04,902 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2024-11-19 05:20:04,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 05:20:05,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 05:20:05,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:05,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2129905669, now seen corresponding path program 2 times [2024-11-19 05:20:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:05,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998893196] [2024-11-19 05:20:05,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:20:05,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:05,461 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:20:05,462 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:20:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:20:05,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:05,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998893196] [2024-11-19 05:20:05,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998893196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:05,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:05,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:20:05,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865180328] [2024-11-19 05:20:05,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:05,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:20:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:05,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:20:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:20:05,826 INFO L87 Difference]: Start difference. First operand 1593 states and 2134 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:06,219 INFO L93 Difference]: Finished difference Result 1737 states and 2329 transitions. [2024-11-19 05:20:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:20:06,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2024-11-19 05:20:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:06,227 INFO L225 Difference]: With dead ends: 1737 [2024-11-19 05:20:06,227 INFO L226 Difference]: Without dead ends: 1604 [2024-11-19 05:20:06,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:20:06,230 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 21 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:06,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1563 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:20:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2024-11-19 05:20:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1597. [2024-11-19 05:20:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1575 states have (on average 1.3358730158730159) internal successors, (2104), 1581 states have internal predecessors, (2104), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:20:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2138 transitions. [2024-11-19 05:20:06,290 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2138 transitions. Word has length 849 [2024-11-19 05:20:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:06,291 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2138 transitions. [2024-11-19 05:20:06,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2138 transitions. [2024-11-19 05:20:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-19 05:20:06,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:06,310 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2024-11-19 05:20:06,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:20:06,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:06,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1841562696, now seen corresponding path program 1 times [2024-11-19 05:20:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299882727] [2024-11-19 05:20:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:20:09,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299882727] [2024-11-19 05:20:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299882727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:09,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:20:09,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767065260] [2024-11-19 05:20:09,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:09,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:20:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:09,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:20:09,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:20:09,426 INFO L87 Difference]: Start difference. First operand 1597 states and 2138 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:09,850 INFO L93 Difference]: Finished difference Result 1749 states and 2343 transitions. [2024-11-19 05:20:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:20:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2024-11-19 05:20:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:09,860 INFO L225 Difference]: With dead ends: 1749 [2024-11-19 05:20:09,860 INFO L226 Difference]: Without dead ends: 1612 [2024-11-19 05:20:09,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:20:09,862 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 25 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:09,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1877 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:20:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2024-11-19 05:20:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1601. [2024-11-19 05:20:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1579 states have (on average 1.3356554781507284) internal successors, (2109), 1585 states have internal predecessors, (2109), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:20:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2143 transitions. [2024-11-19 05:20:09,941 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2143 transitions. Word has length 850 [2024-11-19 05:20:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:09,943 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2143 transitions. [2024-11-19 05:20:09,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2143 transitions. [2024-11-19 05:20:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:20:09,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:09,972 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2024-11-19 05:20:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:20:09,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:09,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 828055761, now seen corresponding path program 1 times [2024-11-19 05:20:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:09,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357874225] [2024-11-19 05:20:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:20:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357874225] [2024-11-19 05:20:13,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357874225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:13,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:13,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:20:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459365835] [2024-11-19 05:20:13,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:13,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:20:13,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:20:13,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:20:13,127 INFO L87 Difference]: Start difference. First operand 1601 states and 2143 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:13,677 INFO L93 Difference]: Finished difference Result 1753 states and 2350 transitions. [2024-11-19 05:20:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:20:13,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:20:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:13,686 INFO L225 Difference]: With dead ends: 1753 [2024-11-19 05:20:13,687 INFO L226 Difference]: Without dead ends: 1612 [2024-11-19 05:20:13,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 05:20:13,689 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 32 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:13,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2531 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:20:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2024-11-19 05:20:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1609. [2024-11-19 05:20:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1587 states have (on average 1.3352236925015752) internal successors, (2119), 1593 states have internal predecessors, (2119), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:20:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2153 transitions. [2024-11-19 05:20:13,748 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2153 transitions. Word has length 851 [2024-11-19 05:20:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:13,749 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2153 transitions. [2024-11-19 05:20:13,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2153 transitions. [2024-11-19 05:20:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:20:13,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:13,759 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2024-11-19 05:20:13,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:20:13,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:13,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1052779818, now seen corresponding path program 1 times [2024-11-19 05:20:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:13,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281624378] [2024-11-19 05:20:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:20:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:20:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:20:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:20:16,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281624378] [2024-11-19 05:20:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281624378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:20:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:20:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:20:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742481002] [2024-11-19 05:20:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:20:16,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:20:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:20:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:20:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:20:16,747 INFO L87 Difference]: Start difference. First operand 1609 states and 2153 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:20:17,084 INFO L93 Difference]: Finished difference Result 1767 states and 2364 transitions. [2024-11-19 05:20:17,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:20:17,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:20:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:20:17,094 INFO L225 Difference]: With dead ends: 1767 [2024-11-19 05:20:17,094 INFO L226 Difference]: Without dead ends: 1618 [2024-11-19 05:20:17,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:20:17,097 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 16 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:20:17,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1583 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:20:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2024-11-19 05:20:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1612. [2024-11-19 05:20:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1590 states have (on average 1.3345911949685534) internal successors, (2122), 1596 states have internal predecessors, (2122), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:20:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2156 transitions. [2024-11-19 05:20:17,176 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2156 transitions. Word has length 851 [2024-11-19 05:20:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:20:17,178 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2156 transitions. [2024-11-19 05:20:17,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:20:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2156 transitions. [2024-11-19 05:20:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-19 05:20:17,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:20:17,192 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2024-11-19 05:20:17,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:20:17,193 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:20:17,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:20:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash -840958853, now seen corresponding path program 1 times [2024-11-19 05:20:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:20:17,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190965949] [2024-11-19 05:20:17,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:20:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms