./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_BER_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 13:52:41,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 13:52:41,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 13:52:41,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 13:52:41,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 13:52:41,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 13:52:41,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 13:52:41,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 13:52:41,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 13:52:41,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 13:52:41,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 13:52:41,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 13:52:41,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 13:52:41,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 13:52:41,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 13:52:41,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 13:52:41,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 13:52:41,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 13:52:41,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 13:52:41,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 13:52:41,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 13:52:41,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 13:52:41,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 13:52:41,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 13:52:41,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 13:52:41,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 13:52:41,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 13:52:41,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 13:52:41,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 13:52:41,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 13:52:41,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 13:52:41,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 13:52:41,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 13:52:41,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 13:52:41,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 13:52:41,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 13:52:41,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 13:52:41,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 13:52:41,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 13:52:41,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 13:52:41,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 13:52:41,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 13:52:41,125 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-10 13:52:41,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 13:52:41,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 13:52:41,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 13:52:41,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 13:52:41,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 13:52:41,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-11-10 13:52:42,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 13:52:42,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 13:52:42,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-11-10 13:52:42,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63dee0f6b/83952f2b30384bf497f4d66c56990766/FLAG23a5e52e0 [2024-11-10 13:52:43,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63dee0f6b/83952f2b30384bf497f4d66c56990766 [2024-11-10 13:52:43,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 13:52:43,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 13:52:43,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 13:52:43,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 13:52:43,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 13:52:43,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:43,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f3b9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43, skipping insertion in model container [2024-11-10 13:52:43,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:43,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 13:52:43,461 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_BER_nondet_test4-3.i[33519,33532] [2024-11-10 13:52:43,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 13:52:43,602 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 13:52:43,633 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_BER_nondet_test4-3.i[33519,33532] [2024-11-10 13:52:43,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 13:52:43,703 INFO L204 MainTranslator]: Completed translation [2024-11-10 13:52:43,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43 WrapperNode [2024-11-10 13:52:43,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 13:52:43,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 13:52:43,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 13:52:43,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 13:52:43,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:43,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:43,808 INFO L138 Inliner]: procedures = 176, calls = 424, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1821 [2024-11-10 13:52:43,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 13:52:43,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 13:52:43,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 13:52:43,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 13:52:43,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:43,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:43,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:43,952 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [401, 2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 98 writes are split as follows [98, 0]. [2024-11-10 13:52:43,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:43,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:44,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:44,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:44,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:44,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:44,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 13:52:44,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 13:52:44,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 13:52:44,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 13:52:44,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (1/1) ... [2024-11-10 13:52:44,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 13:52:44,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 13:52:44,065 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-10 13:52:44,067 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-10 13:52:44,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 13:52:44,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 13:52:44,102 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 13:52:44,102 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 13:52:44,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 13:52:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 13:52:44,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 13:52:44,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 13:52:44,278 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 13:52:44,280 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 13:52:45,465 INFO L? ?]: Removed 419 outVars from TransFormulas that were not future-live. [2024-11-10 13:52:45,465 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 13:52:45,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 13:52:45,525 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 13:52:45,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:52:45 BoogieIcfgContainer [2024-11-10 13:52:45,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 13:52:45,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 13:52:45,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 13:52:45,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 13:52:45,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:52:43" (1/3) ... [2024-11-10 13:52:45,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39efc641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:52:45, skipping insertion in model container [2024-11-10 13:52:45,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:52:43" (2/3) ... [2024-11-10 13:52:45,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39efc641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:52:45, skipping insertion in model container [2024-11-10 13:52:45,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:52:45" (3/3) ... [2024-11-10 13:52:45,533 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-3.i [2024-11-10 13:52:45,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 13:52:45,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 13:52:45,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 13:52:45,606 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;@48a1ea69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 13:52:45,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 13:52:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 462 states have (on average 1.6103896103896105) internal successors, (744), 463 states have internal predecessors, (744), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 13:52:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 13:52:45,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:45,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:45,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:45,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 422595749, now seen corresponding path program 1 times [2024-11-10 13:52:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774375199] [2024-11-10 13:52:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:45,746 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-10 13:52:45,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774375199] [2024-11-10 13:52:45,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774375199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:45,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 13:52:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69381651] [2024-11-10 13:52:45,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:45,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 13:52:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 13:52:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 13:52:45,773 INFO L87 Difference]: Start difference. First operand has 471 states, 462 states have (on average 1.6103896103896105) internal successors, (744), 463 states have internal predecessors, (744), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-10 13:52:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:45,897 INFO L93 Difference]: Finished difference Result 939 states and 1508 transitions. [2024-11-10 13:52:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 13:52:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-10 13:52:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:45,911 INFO L225 Difference]: With dead ends: 939 [2024-11-10 13:52:45,912 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 13:52:45,915 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-10 13:52:45,920 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:45,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 625 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 13:52:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 13:52:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-11-10 13:52:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 397 states have (on average 1.433249370277078) internal successors, (569), 397 states have internal predecessors, (569), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 13:52:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 581 transitions. [2024-11-10 13:52:45,973 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 581 transitions. Word has length 11 [2024-11-10 13:52:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:45,973 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 581 transitions. [2024-11-10 13:52:45,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-10 13:52:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 581 transitions. [2024-11-10 13:52:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 13:52:45,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:45,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:45,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 13:52:45,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:45,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 45740209, now seen corresponding path program 1 times [2024-11-10 13:52:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893611166] [2024-11-10 13:52:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:46,078 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-10 13:52:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893611166] [2024-11-10 13:52:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893611166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:46,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 13:52:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971834183] [2024-11-10 13:52:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:46,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 13:52:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 13:52:46,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:52:46,083 INFO L87 Difference]: Start difference. First operand 405 states and 581 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:52:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:46,462 INFO L93 Difference]: Finished difference Result 1134 states and 1641 transitions. [2024-11-10 13:52:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 13:52:46,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-10 13:52:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:46,466 INFO L225 Difference]: With dead ends: 1134 [2024-11-10 13:52:46,469 INFO L226 Difference]: Without dead ends: 729 [2024-11-10 13:52:46,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:52:46,470 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 469 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:46,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1535 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 13:52:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-10 13:52:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2024-11-10 13:52:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 718 states have (on average 1.448467966573816) internal successors, (1040), 718 states have internal predecessors, (1040), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1058 transitions. [2024-11-10 13:52:46,511 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1058 transitions. Word has length 12 [2024-11-10 13:52:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:46,511 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1058 transitions. [2024-11-10 13:52:46,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 13:52:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1058 transitions. [2024-11-10 13:52:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 13:52:46,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:46,520 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:46,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 13:52:46,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:46,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2144626225, now seen corresponding path program 1 times [2024-11-10 13:52:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:46,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384687733] [2024-11-10 13:52:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:46,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 13:52:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 13:52:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:47,034 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-10 13:52:47,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:47,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384687733] [2024-11-10 13:52:47,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384687733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:47,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 13:52:47,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713359365] [2024-11-10 13:52:47,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:47,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 13:52:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:47,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 13:52:47,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 13:52:47,036 INFO L87 Difference]: Start difference. First operand 729 states and 1058 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 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-10 13:52:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:47,436 INFO L93 Difference]: Finished difference Result 1405 states and 2043 transitions. [2024-11-10 13:52:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 13:52:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 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 176 [2024-11-10 13:52:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:47,442 INFO L225 Difference]: With dead ends: 1405 [2024-11-10 13:52:47,442 INFO L226 Difference]: Without dead ends: 738 [2024-11-10 13:52:47,443 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-10 13:52:47,445 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 108 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:47,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1848 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 13:52:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-10 13:52:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 729. [2024-11-10 13:52:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 718 states have (on average 1.4289693593314763) internal successors, (1026), 718 states have internal predecessors, (1026), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1044 transitions. [2024-11-10 13:52:47,462 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1044 transitions. Word has length 176 [2024-11-10 13:52:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:47,462 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1044 transitions. [2024-11-10 13:52:47,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 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-10 13:52:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1044 transitions. [2024-11-10 13:52:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 13:52:47,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:47,465 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:47,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 13:52:47,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:47,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash 590419384, now seen corresponding path program 1 times [2024-11-10 13:52:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:47,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442041907] [2024-11-10 13:52:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 13:52:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 13:52:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:47,681 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-10 13:52:47,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:47,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442041907] [2024-11-10 13:52:47,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442041907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:47,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:47,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 13:52:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133796437] [2024-11-10 13:52:47,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:47,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 13:52:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:47,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 13:52:47,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:52:47,684 INFO L87 Difference]: Start difference. First operand 729 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 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-10 13:52:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:48,027 INFO L93 Difference]: Finished difference Result 1315 states and 1892 transitions. [2024-11-10 13:52:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 13:52:48,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 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 176 [2024-11-10 13:52:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:48,030 INFO L225 Difference]: With dead ends: 1315 [2024-11-10 13:52:48,031 INFO L226 Difference]: Without dead ends: 730 [2024-11-10 13:52:48,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:52:48,032 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 137 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:48,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1477 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 13:52:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-10 13:52:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 727. [2024-11-10 13:52:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 716 states have (on average 1.4287709497206704) internal successors, (1023), 716 states have internal predecessors, (1023), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1041 transitions. [2024-11-10 13:52:48,047 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1041 transitions. Word has length 176 [2024-11-10 13:52:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:48,047 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1041 transitions. [2024-11-10 13:52:48,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 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-10 13:52:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1041 transitions. [2024-11-10 13:52:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 13:52:48,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:48,050 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:48,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 13:52:48,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:48,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:48,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1726659159, now seen corresponding path program 1 times [2024-11-10 13:52:48,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:48,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789954860] [2024-11-10 13:52:48,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:48,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:48,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 13:52:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 13:52:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 13:52:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:48,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 13:52:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:52:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789954860] [2024-11-10 13:52:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789954860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:48,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:48,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 13:52:48,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685213576] [2024-11-10 13:52:48,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:48,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 13:52:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 13:52:48,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 13:52:48,372 INFO L87 Difference]: Start difference. First operand 727 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 13:52:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:48,738 INFO L93 Difference]: Finished difference Result 1173 states and 1683 transitions. [2024-11-10 13:52:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 13:52:48,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2024-11-10 13:52:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:48,741 INFO L225 Difference]: With dead ends: 1173 [2024-11-10 13:52:48,741 INFO L226 Difference]: Without dead ends: 646 [2024-11-10 13:52:48,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-10 13:52:48,743 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 33 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:48,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1632 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 13:52:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-10 13:52:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 643. [2024-11-10 13:52:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 632 states have (on average 1.375) internal successors, (869), 632 states have internal predecessors, (869), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 887 transitions. [2024-11-10 13:52:48,759 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 887 transitions. Word has length 191 [2024-11-10 13:52:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:48,759 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 887 transitions. [2024-11-10 13:52:48,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 13:52:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 887 transitions. [2024-11-10 13:52:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 13:52:48,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:48,763 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 13:52:48,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -877750050, now seen corresponding path program 1 times [2024-11-10 13:52:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:48,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355220287] [2024-11-10 13:52:48,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:49,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 13:52:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:49,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 13:52:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 13:52:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:49,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 13:52:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 13:52:49,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355220287] [2024-11-10 13:52:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355220287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 13:52:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179698437] [2024-11-10 13:52:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:49,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 13:52:49,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 13:52:49,595 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-10 13:52:49,600 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-10 13:52:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:50,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 13:52:50,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 13:52:50,058 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 22 treesize of output 7 [2024-11-10 13:52:50,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 13:52:50,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2024-11-10 13:52:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:52:50,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 13:52:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179698437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:50,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 13:52:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-10 13:52:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978386970] [2024-11-10 13:52:50,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:50,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 13:52:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 13:52:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 13:52:50,663 INFO L87 Difference]: Start difference. First operand 643 states and 887 transitions. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 13:52:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:52,156 INFO L93 Difference]: Finished difference Result 1313 states and 1801 transitions. [2024-11-10 13:52:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 13:52:52,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2024-11-10 13:52:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:52,161 INFO L225 Difference]: With dead ends: 1313 [2024-11-10 13:52:52,161 INFO L226 Difference]: Without dead ends: 758 [2024-11-10 13:52:52,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-10 13:52:52,163 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 751 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:52,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 2722 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 13:52:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-10 13:52:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 674. [2024-11-10 13:52:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 663 states have (on average 1.368024132730015) internal successors, (907), 663 states have internal predecessors, (907), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 925 transitions. [2024-11-10 13:52:52,180 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 925 transitions. Word has length 191 [2024-11-10 13:52:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:52,180 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 925 transitions. [2024-11-10 13:52:52,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 13:52:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 925 transitions. [2024-11-10 13:52:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 13:52:52,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:52,182 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:52,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 13:52:52,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 13:52:52,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash -592614147, now seen corresponding path program 1 times [2024-11-10 13:52:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45401435] [2024-11-10 13:52:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:52,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 13:52:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 13:52:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 13:52:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 13:52:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:52:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:52,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45401435] [2024-11-10 13:52:52,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45401435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:52,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:52,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 13:52:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556008532] [2024-11-10 13:52:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:52,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 13:52:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:52,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 13:52:52,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:52:52,564 INFO L87 Difference]: Start difference. First operand 674 states and 925 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 13:52:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:53,491 INFO L93 Difference]: Finished difference Result 1267 states and 1752 transitions. [2024-11-10 13:52:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 13:52:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2024-11-10 13:52:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:53,495 INFO L225 Difference]: With dead ends: 1267 [2024-11-10 13:52:53,495 INFO L226 Difference]: Without dead ends: 693 [2024-11-10 13:52:53,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 13:52:53,496 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 5 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:53,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1236 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 13:52:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-10 13:52:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 688. [2024-11-10 13:52:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 677 states have (on average 1.3574593796159526) internal successors, (919), 677 states have internal predecessors, (919), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 937 transitions. [2024-11-10 13:52:53,510 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 937 transitions. Word has length 191 [2024-11-10 13:52:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:53,511 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 937 transitions. [2024-11-10 13:52:53,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 13:52:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 937 transitions. [2024-11-10 13:52:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 13:52:53,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:53,513 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:53,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 13:52:53,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:53,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1454918308, now seen corresponding path program 1 times [2024-11-10 13:52:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060903932] [2024-11-10 13:52:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 13:52:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:53,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 13:52:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 13:52:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 13:52:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:52:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060903932] [2024-11-10 13:52:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060903932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:53,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:53,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 13:52:53,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145096145] [2024-11-10 13:52:53,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:53,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 13:52:53,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:53,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 13:52:53,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 13:52:53,709 INFO L87 Difference]: Start difference. First operand 688 states and 937 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 13:52:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:54,014 INFO L93 Difference]: Finished difference Result 1208 states and 1647 transitions. [2024-11-10 13:52:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 13:52:54,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2024-11-10 13:52:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:54,017 INFO L225 Difference]: With dead ends: 1208 [2024-11-10 13:52:54,017 INFO L226 Difference]: Without dead ends: 550 [2024-11-10 13:52:54,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-10 13:52:54,018 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 12 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:54,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1365 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 13:52:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-10 13:52:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 547. [2024-11-10 13:52:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 536 states have (on average 1.3208955223880596) internal successors, (708), 536 states have internal predecessors, (708), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 726 transitions. [2024-11-10 13:52:54,030 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 726 transitions. Word has length 191 [2024-11-10 13:52:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:54,030 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 726 transitions. [2024-11-10 13:52:54,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 13:52:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 726 transitions. [2024-11-10 13:52:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-10 13:52:54,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:54,032 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:54,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 13:52:54,032 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:54,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1553338301, now seen corresponding path program 1 times [2024-11-10 13:52:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814692398] [2024-11-10 13:52:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:54,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 13:52:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 13:52:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 13:52:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:54,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 13:52:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 13:52:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814692398] [2024-11-10 13:52:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814692398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 13:52:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069473914] [2024-11-10 13:52:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 13:52:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 13:52:54,843 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-10 13:52:54,844 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-10 13:52:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:55,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 13:52:55,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 13:52:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 13:52:55,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 13:52:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069473914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:55,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 13:52:55,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2024-11-10 13:52:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761544905] [2024-11-10 13:52:55,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:55,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 13:52:55,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 13:52:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 13:52:55,419 INFO L87 Difference]: Start difference. First operand 547 states and 726 transitions. Second operand has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 13:52:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:55,704 INFO L93 Difference]: Finished difference Result 928 states and 1245 transitions. [2024-11-10 13:52:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 13:52:55,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 192 [2024-11-10 13:52:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:55,707 INFO L225 Difference]: With dead ends: 928 [2024-11-10 13:52:55,707 INFO L226 Difference]: Without dead ends: 569 [2024-11-10 13:52:55,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 13:52:55,708 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 25 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:55,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2286 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 13:52:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-10 13:52:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 561. [2024-11-10 13:52:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 550 states have (on average 1.3163636363636364) internal successors, (724), 550 states have internal predecessors, (724), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 742 transitions. [2024-11-10 13:52:55,720 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 742 transitions. Word has length 192 [2024-11-10 13:52:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:55,721 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 742 transitions. [2024-11-10 13:52:55,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 13:52:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 742 transitions. [2024-11-10 13:52:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 13:52:55,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:55,722 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:55,742 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-10 13:52:55,922 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-10 13:52:55,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1566681322, now seen corresponding path program 1 times [2024-11-10 13:52:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964949567] [2024-11-10 13:52:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:56,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 13:52:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 13:52:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:56,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 13:52:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:56,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 13:52:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:52:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964949567] [2024-11-10 13:52:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964949567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:56,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:56,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 13:52:56,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773418802] [2024-11-10 13:52:56,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:56,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 13:52:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:56,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 13:52:56,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 13:52:56,446 INFO L87 Difference]: Start difference. First operand 561 states and 742 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 6 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 13:52:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:56,964 INFO L93 Difference]: Finished difference Result 925 states and 1240 transitions. [2024-11-10 13:52:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 13:52:56,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 6 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2024-11-10 13:52:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:56,966 INFO L225 Difference]: With dead ends: 925 [2024-11-10 13:52:56,967 INFO L226 Difference]: Without dead ends: 560 [2024-11-10 13:52:56,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 13:52:56,967 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 16 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:56,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1873 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 13:52:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-10 13:52:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 555. [2024-11-10 13:52:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 544 states have (on average 1.3125) internal successors, (714), 544 states have internal predecessors, (714), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 732 transitions. [2024-11-10 13:52:56,980 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 732 transitions. Word has length 193 [2024-11-10 13:52:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:56,980 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 732 transitions. [2024-11-10 13:52:56,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 6 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 13:52:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 732 transitions. [2024-11-10 13:52:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 13:52:56,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:56,983 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:56,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 13:52:56,983 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:56,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1709966458, now seen corresponding path program 1 times [2024-11-10 13:52:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172691705] [2024-11-10 13:52:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 13:52:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 13:52:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 13:52:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 13:52:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 13:52:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:57,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172691705] [2024-11-10 13:52:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172691705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 13:52:57,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 13:52:57,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 13:52:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950049882] [2024-11-10 13:52:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 13:52:57,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 13:52:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 13:52:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 13:52:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 13:52:57,379 INFO L87 Difference]: Start difference. First operand 555 states and 732 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 6 states have internal predecessors, (177), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 13:52:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 13:52:57,751 INFO L93 Difference]: Finished difference Result 924 states and 1237 transitions. [2024-11-10 13:52:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 13:52:57,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 6 states have internal predecessors, (177), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 194 [2024-11-10 13:52:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 13:52:57,753 INFO L225 Difference]: With dead ends: 924 [2024-11-10 13:52:57,754 INFO L226 Difference]: Without dead ends: 564 [2024-11-10 13:52:57,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 13:52:57,755 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 11 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 13:52:57,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1605 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 13:52:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-10 13:52:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2024-11-10 13:52:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 550 states have (on average 1.309090909090909) internal successors, (720), 550 states have internal predecessors, (720), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 13:52:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 738 transitions. [2024-11-10 13:52:57,767 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 738 transitions. Word has length 194 [2024-11-10 13:52:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 13:52:57,767 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 738 transitions. [2024-11-10 13:52:57,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 6 states have internal predecessors, (177), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 13:52:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 738 transitions. [2024-11-10 13:52:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 13:52:57,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 13:52:57,769 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 13:52:57,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 13:52:57,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 13:52:57,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 13:52:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1022104149, now seen corresponding path program 1 times [2024-11-10 13:52:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 13:52:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285336589] [2024-11-10 13:52:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 13:52:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 13:52:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 13:52:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:58,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 13:52:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:58,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 13:52:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 13:52:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 13:52:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285336589] [2024-11-10 13:52:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285336589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 13:52:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987123525] [2024-11-10 13:52:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 13:52:58,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 13:52:58,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 13:52:58,382 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-10 13:52:58,383 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-10 13:52:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 13:52:59,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 13:52:59,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 13:53:19,752 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 13:53:35,774 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 13:54:07,869 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 13:54:18,313 WARN L286 SmtUtils]: Spent 7.71s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)