./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_JEN_test7-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 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 22:58:21,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 22:58:21,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 22:58:21,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 22:58:21,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 22:58:21,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 22:58:21,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 22:58:21,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 22:58:21,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 22:58:21,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 22:58:21,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 22:58:21,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 22:58:21,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 22:58:21,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 22:58:21,325 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 22:58:21,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 22:58:21,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 22:58:21,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 22:58:21,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 22:58:21,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 22:58:21,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 22:58:21,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 22:58:21,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 22:58:21,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 22:58:21,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 22:58:21,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 22:58:21,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 22:58:21,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 22:58:21,328 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 22:58:21,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 22:58:21,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 22:58:21,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 22:58:21,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:58:21,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 22:58:21,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 22:58:21,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 22:58:21,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 22:58:21,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 22:58:21,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 22:58:21,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 22:58:21,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 22:58:21,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 22:58:21,333 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 -> 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d [2024-11-16 22:58:21,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 22:58:21,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 22:58:21,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 22:58:21,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 22:58:21,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 22:58:21,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2024-11-16 22:58:22,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 22:58:23,145 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 22:58:23,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2024-11-16 22:58:23,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92880cf3b/fce33814653541b690369222cdb78452/FLAGd51071f42 [2024-11-16 22:58:23,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92880cf3b/fce33814653541b690369222cdb78452 [2024-11-16 22:58:23,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 22:58:23,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 22:58:23,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 22:58:23,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 22:58:23,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 22:58:23,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea50081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23, skipping insertion in model container [2024-11-16 22:58:23,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 22:58:23,500 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_JEN_test7-2.i[33021,33034] [2024-11-16 22:58:23,600 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_JEN_test7-2.i[44124,44137] [2024-11-16 22:58:23,600 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_JEN_test7-2.i[44245,44258] [2024-11-16 22:58:23,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:58:23,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 22:58:23,651 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_JEN_test7-2.i[33021,33034] [2024-11-16 22:58:23,714 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_JEN_test7-2.i[44124,44137] [2024-11-16 22:58:23,715 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_JEN_test7-2.i[44245,44258] [2024-11-16 22:58:23,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:58:23,767 INFO L204 MainTranslator]: Completed translation [2024-11-16 22:58:23,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23 WrapperNode [2024-11-16 22:58:23,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 22:58:23,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 22:58:23,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 22:58:23,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 22:58:23,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,856 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1549 [2024-11-16 22:58:23,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 22:58:23,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 22:58:23,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 22:58:23,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 22:58:23,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,956 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-16 22:58:23,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:23,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:24,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:24,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:24,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 22:58:24,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 22:58:24,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 22:58:24,023 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 22:58:24,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (1/1) ... [2024-11-16 22:58:24,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:58:24,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:58:24,050 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-16 22:58:24,056 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-16 22:58:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 22:58:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-16 22:58:24,149 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 22:58:24,149 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 22:58:24,149 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 22:58:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 22:58:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 22:58:24,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 22:58:24,322 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 22:58:24,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 22:58:25,299 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 22:58:25,372 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-11-16 22:58:25,372 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 22:58:25,415 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 22:58:25,417 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 22:58:25,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:58:25 BoogieIcfgContainer [2024-11-16 22:58:25,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 22:58:25,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 22:58:25,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 22:58:25,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 22:58:25,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:58:23" (1/3) ... [2024-11-16 22:58:25,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50497266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:25, skipping insertion in model container [2024-11-16 22:58:25,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:23" (2/3) ... [2024-11-16 22:58:25,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50497266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:25, skipping insertion in model container [2024-11-16 22:58:25,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:58:25" (3/3) ... [2024-11-16 22:58:25,425 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test7-2.i [2024-11-16 22:58:25,437 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 22:58:25,437 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 22:58:25,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 22:58:25,501 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;@333ac418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 22:58:25,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 22:58:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 436 states, 429 states have (on average 1.6177156177156178) internal successors, (694), 431 states have internal predecessors, (694), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:58:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 22:58:25,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:25,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:58:25,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1809797008, now seen corresponding path program 1 times [2024-11-16 22:58:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953821300] [2024-11-16 22:58:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:25,656 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-16 22:58:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953821300] [2024-11-16 22:58:25,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953821300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:58:25,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:58:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 22:58:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928537171] [2024-11-16 22:58:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:58:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 22:58:25,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 22:58:25,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 22:58:25,687 INFO L87 Difference]: Start difference. First operand has 436 states, 429 states have (on average 1.6177156177156178) internal successors, (694), 431 states have internal predecessors, (694), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-16 22:58:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:25,821 INFO L93 Difference]: Finished difference Result 869 states and 1397 transitions. [2024-11-16 22:58:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 22:58:25,824 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-16 22:58:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:25,836 INFO L225 Difference]: With dead ends: 869 [2024-11-16 22:58:25,837 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 22:58:25,843 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-16 22:58:25,845 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:25,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:58:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 22:58:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-16 22:58:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 390 states have (on average 1.4435897435897436) internal successors, (563), 391 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:58:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 569 transitions. [2024-11-16 22:58:25,914 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 569 transitions. Word has length 9 [2024-11-16 22:58:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:25,914 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 569 transitions. [2024-11-16 22:58:25,915 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-16 22:58:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 569 transitions. [2024-11-16 22:58:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 22:58:25,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:25,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:58:25,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 22:58:25,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:25,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1397038791, now seen corresponding path program 1 times [2024-11-16 22:58:25,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:25,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667769395] [2024-11-16 22:58:25,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:25,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:26,081 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-16 22:58:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667769395] [2024-11-16 22:58:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667769395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:58:26,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:58:26,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:58:26,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677323257] [2024-11-16 22:58:26,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:58:26,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:58:26,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:26,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:58:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:58:26,091 INFO L87 Difference]: Start difference. First operand 396 states and 569 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-16 22:58:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:26,318 INFO L93 Difference]: Finished difference Result 978 states and 1409 transitions. [2024-11-16 22:58:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 22:58:26,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-16 22:58:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:26,322 INFO L225 Difference]: With dead ends: 978 [2024-11-16 22:58:26,322 INFO L226 Difference]: Without dead ends: 785 [2024-11-16 22:58:26,322 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-16 22:58:26,323 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 553 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:26,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1600 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 22:58:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-16 22:58:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 398. [2024-11-16 22:58:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 392 states have (on average 1.441326530612245) internal successors, (565), 393 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:58:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 571 transitions. [2024-11-16 22:58:26,352 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 571 transitions. Word has length 11 [2024-11-16 22:58:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:26,352 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 571 transitions. [2024-11-16 22:58:26,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-16 22:58:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 571 transitions. [2024-11-16 22:58:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-16 22:58:26,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:26,356 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] [2024-11-16 22:58:26,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 22:58:26,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:26,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash -379407965, now seen corresponding path program 1 times [2024-11-16 22:58:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:26,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062422797] [2024-11-16 22:58:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:26,691 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-16 22:58:26,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:26,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062422797] [2024-11-16 22:58:26,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062422797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:58:26,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:58:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:58:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599544393] [2024-11-16 22:58:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:58:26,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:58:26,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:58:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:58:26,695 INFO L87 Difference]: Start difference. First operand 398 states and 571 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-16 22:58:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:26,822 INFO L93 Difference]: Finished difference Result 750 states and 1072 transitions. [2024-11-16 22:58:26,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:58:26,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-16 22:58:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:26,824 INFO L225 Difference]: With dead ends: 750 [2024-11-16 22:58:26,824 INFO L226 Difference]: Without dead ends: 356 [2024-11-16 22:58:26,825 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-16 22:58:26,827 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 30 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:26,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1282 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:58:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-16 22:58:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-16 22:58:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 350 states have (on average 1.3942857142857144) internal successors, (488), 351 states have internal predecessors, (488), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:58:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 494 transitions. [2024-11-16 22:58:26,838 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 494 transitions. Word has length 88 [2024-11-16 22:58:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:26,838 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 494 transitions. [2024-11-16 22:58:26,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-16 22:58:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 494 transitions. [2024-11-16 22:58:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-16 22:58:26,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:26,842 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] [2024-11-16 22:58:26,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 22:58:26,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:26,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:26,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2045479428, now seen corresponding path program 1 times [2024-11-16 22:58:26,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:26,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737250999] [2024-11-16 22:58:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:26,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:27,001 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-16 22:58:27,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:27,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737250999] [2024-11-16 22:58:27,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737250999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:58:27,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:58:27,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 22:58:27,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661929677] [2024-11-16 22:58:27,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:58:27,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 22:58:27,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:27,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 22:58:27,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 22:58:27,005 INFO L87 Difference]: Start difference. First operand 356 states and 494 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-16 22:58:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:27,144 INFO L93 Difference]: Finished difference Result 965 states and 1350 transitions. [2024-11-16 22:58:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 22:58:27,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-16 22:58:27,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:27,149 INFO L225 Difference]: With dead ends: 965 [2024-11-16 22:58:27,149 INFO L226 Difference]: Without dead ends: 613 [2024-11-16 22:58:27,149 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-16 22:58:27,151 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 300 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:27,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1054 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:58:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-16 22:58:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 605. [2024-11-16 22:58:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 599 states have (on average 1.4123539232053421) internal successors, (846), 600 states have internal predecessors, (846), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:58:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 852 transitions. [2024-11-16 22:58:27,165 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 852 transitions. Word has length 88 [2024-11-16 22:58:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:27,166 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 852 transitions. [2024-11-16 22:58:27,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-16 22:58:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 852 transitions. [2024-11-16 22:58:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 22:58:27,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:27,172 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] [2024-11-16 22:58:27,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 22:58:27,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:27,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash 245534506, now seen corresponding path program 1 times [2024-11-16 22:58:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132964200] [2024-11-16 22:58:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:58:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:27,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:58:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:27,461 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-16 22:58:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132964200] [2024-11-16 22:58:27,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132964200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:58:27,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:58:27,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:58:27,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964804465] [2024-11-16 22:58:27,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:58:27,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:58:27,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:58:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:58:27,465 INFO L87 Difference]: Start difference. First operand 605 states and 852 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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-16 22:58:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:27,772 INFO L93 Difference]: Finished difference Result 894 states and 1263 transitions. [2024-11-16 22:58:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:58:27,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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 103 [2024-11-16 22:58:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:27,777 INFO L225 Difference]: With dead ends: 894 [2024-11-16 22:58:27,777 INFO L226 Difference]: Without dead ends: 889 [2024-11-16 22:58:27,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:58:27,778 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 465 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:27,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1656 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 22:58:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-16 22:58:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 607. [2024-11-16 22:58:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 601 states have (on average 1.410981697171381) internal successors, (848), 602 states have internal predecessors, (848), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:58:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 854 transitions. [2024-11-16 22:58:27,804 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 854 transitions. Word has length 103 [2024-11-16 22:58:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:27,806 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 854 transitions. [2024-11-16 22:58:27,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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-16 22:58:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 854 transitions. [2024-11-16 22:58:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 22:58:27,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:27,808 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] [2024-11-16 22:58:27,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 22:58:27,808 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:27,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2054259800, now seen corresponding path program 1 times [2024-11-16 22:58:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:27,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097558966] [2024-11-16 22:58:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:58:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:28,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:58:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:28,041 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-16 22:58:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097558966] [2024-11-16 22:58:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097558966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:58:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:58:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:58:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72026875] [2024-11-16 22:58:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:58:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:58:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:58:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:58:28,043 INFO L87 Difference]: Start difference. First operand 607 states and 854 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 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-16 22:58:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:28,283 INFO L93 Difference]: Finished difference Result 879 states and 1244 transitions. [2024-11-16 22:58:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 22:58:28,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 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 157 [2024-11-16 22:58:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:28,286 INFO L225 Difference]: With dead ends: 879 [2024-11-16 22:58:28,286 INFO L226 Difference]: Without dead ends: 526 [2024-11-16 22:58:28,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:58:28,287 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 33 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:28,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1345 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 22:58:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-16 22:58:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2024-11-16 22:58:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 517 states have (on average 1.3423597678916828) internal successors, (694), 518 states have internal predecessors, (694), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:58:28,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 700 transitions. [2024-11-16 22:58:28,295 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 700 transitions. Word has length 157 [2024-11-16 22:58:28,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:28,295 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 700 transitions. [2024-11-16 22:58:28,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 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-16 22:58:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 700 transitions. [2024-11-16 22:58:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 22:58:28,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:28,297 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] [2024-11-16 22:58:28,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 22:58:28,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:28,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1178436863, now seen corresponding path program 1 times [2024-11-16 22:58:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:28,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074654577] [2024-11-16 22:58:28,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:28,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:58:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:58:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:28,529 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-16 22:58:28,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:28,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074654577] [2024-11-16 22:58:28,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074654577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:58:28,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:58:28,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:58:28,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462654925] [2024-11-16 22:58:28,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:58:28,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:58:28,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:28,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:58:28,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:58:28,532 INFO L87 Difference]: Start difference. First operand 523 states and 700 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 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-16 22:58:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:28,833 INFO L93 Difference]: Finished difference Result 1106 states and 1482 transitions. [2024-11-16 22:58:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:58:28,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 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 157 [2024-11-16 22:58:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:28,836 INFO L225 Difference]: With dead ends: 1106 [2024-11-16 22:58:28,836 INFO L226 Difference]: Without dead ends: 675 [2024-11-16 22:58:28,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:58:28,838 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 818 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:28,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1137 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 22:58:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-16 22:58:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2024-11-16 22:58:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 658 states have (on average 1.344984802431611) internal successors, (885), 659 states have internal predecessors, (885), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:58:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 891 transitions. [2024-11-16 22:58:28,855 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 891 transitions. Word has length 157 [2024-11-16 22:58:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:28,855 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 891 transitions. [2024-11-16 22:58:28,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 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-16 22:58:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 891 transitions. [2024-11-16 22:58:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 22:58:28,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:28,857 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, 1, 1, 1] [2024-11-16 22:58:28,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 22:58:28,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:28,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash 143942780, now seen corresponding path program 1 times [2024-11-16 22:58:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931322533] [2024-11-16 22:58:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:58:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:58:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:29,372 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-16 22:58:29,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931322533] [2024-11-16 22:58:29,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931322533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:58:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391496639] [2024-11-16 22:58:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:29,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:58:29,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:58:29,375 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-16 22:58:29,377 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-16 22:58:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:29,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 22:58:29,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:58:29,688 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 11 treesize of output 7 [2024-11-16 22:58:29,855 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 19 treesize of output 11 [2024-11-16 22:58:29,871 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-16 22:58:29,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 22:58:30,028 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-16 22:58:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391496639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 22:58:30,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 22:58:30,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 13 [2024-11-16 22:58:30,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257769716] [2024-11-16 22:58:30,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 22:58:30,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 22:58:30,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 22:58:30,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-16 22:58:30,034 INFO L87 Difference]: Start difference. First operand 664 states and 891 transitions. Second operand has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:58:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:30,736 INFO L93 Difference]: Finished difference Result 2977 states and 4010 transitions. [2024-11-16 22:58:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 22:58:30,737 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 168 [2024-11-16 22:58:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:30,744 INFO L225 Difference]: With dead ends: 2977 [2024-11-16 22:58:30,744 INFO L226 Difference]: Without dead ends: 2564 [2024-11-16 22:58:30,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 332 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-16 22:58:30,747 INFO L432 NwaCegarLoop]: 703 mSDtfsCounter, 2640 mSDsluCounter, 4117 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:30,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 4820 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 22:58:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-16 22:58:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1016. [2024-11-16 22:58:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1006 states have (on average 1.3389662027833003) internal successors, (1347), 1007 states have internal predecessors, (1347), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 22:58:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1359 transitions. [2024-11-16 22:58:30,794 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1359 transitions. Word has length 168 [2024-11-16 22:58:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:30,794 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1359 transitions. [2024-11-16 22:58:30,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.615384615384617) internal successors, (333), 12 states have internal predecessors, (333), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:58:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1359 transitions. [2024-11-16 22:58:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-16 22:58:30,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:30,798 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, 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, 1, 1] [2024-11-16 22:58:30,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 22:58:31,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:58:31,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:31,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1324378693, now seen corresponding path program 1 times [2024-11-16 22:58:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926288068] [2024-11-16 22:58:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:33,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:58:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:33,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:58:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:58:33,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926288068] [2024-11-16 22:58:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926288068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:58:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486845378] [2024-11-16 22:58:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:33,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:58:33,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:58:33,522 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-16 22:58:33,523 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-16 22:58:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:34,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 1902 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 22:58:34,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:58:34,054 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 11 treesize of output 7 [2024-11-16 22:58:34,201 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 19 treesize of output 11 [2024-11-16 22:58:34,296 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 19 treesize of output 11 [2024-11-16 22:58:34,388 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 19 treesize of output 11 [2024-11-16 22:58:34,505 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 19 treesize of output 11 [2024-11-16 22:58:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:58:34,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 22:58:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:58:34,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486845378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 22:58:34,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 22:58:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2024-11-16 22:58:34,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434984662] [2024-11-16 22:58:34,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 22:58:34,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 22:58:34,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 22:58:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2024-11-16 22:58:34,966 INFO L87 Difference]: Start difference. First operand 1016 states and 1359 transitions. Second operand has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:58:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:36,763 INFO L93 Difference]: Finished difference Result 6313 states and 8513 transitions. [2024-11-16 22:58:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-16 22:58:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 399 [2024-11-16 22:58:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:36,779 INFO L225 Difference]: With dead ends: 6313 [2024-11-16 22:58:36,779 INFO L226 Difference]: Without dead ends: 5900 [2024-11-16 22:58:36,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 790 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 22:58:36,781 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 8111 mSDsluCounter, 13970 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8131 SdHoareTripleChecker+Valid, 15717 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:36,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8131 Valid, 15717 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 22:58:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5900 states. [2024-11-16 22:58:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5900 to 1892. [2024-11-16 22:58:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1876 states have (on average 1.3352878464818763) internal successors, (2505), 1877 states have internal predecessors, (2505), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 22:58:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2529 transitions. [2024-11-16 22:58:36,836 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2529 transitions. Word has length 399 [2024-11-16 22:58:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:36,837 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2529 transitions. [2024-11-16 22:58:36,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 42.75) internal successors, (1026), 23 states have internal predecessors, (1026), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:58:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2529 transitions. [2024-11-16 22:58:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2024-11-16 22:58:36,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:36,849 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, 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-16 22:58:36,871 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-16 22:58:37,053 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,SelfDestructingSolverStorable8 [2024-11-16 22:58:37,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:37,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1146831515, now seen corresponding path program 2 times [2024-11-16 22:58:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:37,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894057730] [2024-11-16 22:58:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:58:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:45,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:58:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:58:45,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:45,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894057730] [2024-11-16 22:58:45,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894057730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:58:45,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975581745] [2024-11-16 22:58:45,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 22:58:45,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:58:45,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:58:45,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:58:45,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 22:58:45,613 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 22:58:45,613 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 22:58:45,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 22:58:45,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:58:45,649 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 11 treesize of output 7 [2024-11-16 22:58:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3471 trivial. 0 not checked. [2024-11-16 22:58:46,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 22:58:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975581745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:58:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 22:58:46,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 27 [2024-11-16 22:58:46,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238174771] [2024-11-16 22:58:46,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:58:46,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 22:58:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:46,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 22:58:46,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-11-16 22:58:46,178 INFO L87 Difference]: Start difference. First operand 1892 states and 2529 transitions. Second operand has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 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-16 22:58:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:58:46,966 INFO L93 Difference]: Finished difference Result 2484 states and 3320 transitions. [2024-11-16 22:58:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 22:58:46,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 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 861 [2024-11-16 22:58:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:58:46,973 INFO L225 Difference]: With dead ends: 2484 [2024-11-16 22:58:46,973 INFO L226 Difference]: Without dead ends: 2074 [2024-11-16 22:58:46,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 861 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 22:58:46,975 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 398 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 22:58:46,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 2515 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 22:58:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2024-11-16 22:58:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1928. [2024-11-16 22:58:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1912 states have (on average 1.3310669456066946) internal successors, (2545), 1913 states have internal predecessors, (2545), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 22:58:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2569 transitions. [2024-11-16 22:58:47,014 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2569 transitions. Word has length 861 [2024-11-16 22:58:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:58:47,015 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2569 transitions. [2024-11-16 22:58:47,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 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-16 22:58:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2569 transitions. [2024-11-16 22:58:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2024-11-16 22:58:47,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:58:47,030 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, 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-16 22:58:47,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 22:58:47,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:58:47,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:58:47,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:58:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 322649515, now seen corresponding path program 1 times [2024-11-16 22:58:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:58:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813172680] [2024-11-16 22:58:47,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:58:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:58:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:55,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:58:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:58:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:58:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813172680] [2024-11-16 22:58:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813172680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:58:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77747611] [2024-11-16 22:58:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:58:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:58:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:58:55,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:58:55,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 22:58:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:58:56,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 4171 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 22:58:56,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:58:56,129 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 11 treesize of output 7 [2024-11-16 22:58:56,279 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 19 treesize of output 11 [2024-11-16 22:58:56,372 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 19 treesize of output 11 [2024-11-16 22:58:56,461 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 19 treesize of output 11 [2024-11-16 22:58:56,534 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 19 treesize of output 11 [2024-11-16 22:58:56,609 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 19 treesize of output 11 [2024-11-16 22:58:56,693 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 19 treesize of output 11 [2024-11-16 22:58:56,781 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 19 treesize of output 11 [2024-11-16 22:58:56,867 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 19 treesize of output 11 [2024-11-16 22:58:56,942 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 19 treesize of output 11 [2024-11-16 22:58:57,024 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 19 treesize of output 11 [2024-11-16 22:58:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:58:57,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 22:58:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:58:57,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77747611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 22:58:57,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 22:58:57,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 43 [2024-11-16 22:58:57,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027940594] [2024-11-16 22:58:57,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 22:58:57,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-16 22:58:57,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:58:57,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-16 22:58:57,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=1209, Unknown=0, NotChecked=0, Total=1806 [2024-11-16 22:58:57,912 INFO L87 Difference]: Start difference. First operand 1928 states and 2569 transitions. Second operand has 43 states, 43 states have (on average 56.116279069767444) internal successors, (2413), 42 states have internal predecessors, (2413), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:59:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:59:02,101 INFO L93 Difference]: Finished difference Result 13021 states and 17558 transitions. [2024-11-16 22:59:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-16 22:59:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 56.116279069767444) internal successors, (2413), 42 states have internal predecessors, (2413), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 862 [2024-11-16 22:59:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:59:02,139 INFO L225 Difference]: With dead ends: 13021 [2024-11-16 22:59:02,139 INFO L226 Difference]: Without dead ends: 12572 [2024-11-16 22:59:02,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1771 GetRequests, 1705 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1134, Invalid=3026, Unknown=0, NotChecked=0, Total=4160 [2024-11-16 22:59:02,146 INFO L432 NwaCegarLoop]: 3834 mSDtfsCounter, 15752 mSDsluCounter, 48434 mSDsCounter, 0 mSdLazyCounter, 6245 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15796 SdHoareTripleChecker+Valid, 52268 SdHoareTripleChecker+Invalid, 6372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 6245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-16 22:59:02,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15796 Valid, 52268 Invalid, 6372 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [127 Valid, 6245 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-16 22:59:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2024-11-16 22:59:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 3680. [2024-11-16 22:59:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3652 states have (on average 1.3310514786418401) internal successors, (4861), 3653 states have internal predecessors, (4861), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 22:59:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4909 transitions. [2024-11-16 22:59:02,288 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 4909 transitions. Word has length 862 [2024-11-16 22:59:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:59:02,289 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 4909 transitions. [2024-11-16 22:59:02,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 56.116279069767444) internal successors, (2413), 42 states have internal predecessors, (2413), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 22:59:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4909 transitions. [2024-11-16 22:59:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1787 [2024-11-16 22:59:02,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:59:02,305 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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-16 22:59:02,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 22:59:02,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:59:02,506 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:59:02,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:59:02,507 INFO L85 PathProgramCache]: Analyzing trace with hash -675204117, now seen corresponding path program 2 times [2024-11-16 22:59:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:59:02,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179018656] [2024-11-16 22:59:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:59:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:59:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:59:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:59:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:59:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:59:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:59:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17793 backedges. 0 proven. 17789 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:59:33,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:59:33,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179018656] [2024-11-16 22:59:33,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179018656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:59:33,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711452327] [2024-11-16 22:59:33,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 22:59:33,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:59:33,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:59:33,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:59:33,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 22:59:34,805 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 22:59:34,805 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 22:59:34,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 22:59:34,826 INFO L278 TraceCheckSpWp]: Computing forward predicates...