./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_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-3289d67-m [2024-11-16 22:49:25,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 22:49:25,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 22:49:25,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 22:49:25,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 22:49:25,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 22:49:25,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 22:49:25,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 22:49:25,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 22:49:25,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 22:49:25,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 22:49:25,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 22:49:25,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 22:49:25,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 22:49:25,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 22:49:25,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 22:49:25,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 22:49:25,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 22:49:25,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 22:49:25,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 22:49:25,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 22:49:25,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 22:49:25,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 22:49:25,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 22:49:25,217 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 22:49:25,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 22:49:25,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 22:49:25,218 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 22:49:25,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 22:49:25,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 22:49:25,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 22:49:25,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 22:49:25,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:49:25,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 22:49:25,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 22:49:25,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 22:49:25,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 22:49:25,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 22:49:25,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 22:49:25,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 22:49:25,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 22:49:25,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 22:49:25,222 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-16 22:49:25,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 22:49:25,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 22:49:25,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 22:49:25,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 22:49:25,513 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 22:49:25,514 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-16 22:49:26,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 22:49:27,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 22:49:27,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-11-16 22:49:27,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9678992/00525b0bd7d344f0b6661aa47b1464f8/FLAGf645bdbb0 [2024-11-16 22:49:27,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9678992/00525b0bd7d344f0b6661aa47b1464f8 [2024-11-16 22:49:27,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 22:49:27,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 22:49:27,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 22:49:27,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 22:49:27,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 22:49:27,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:27,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e47d953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27, skipping insertion in model container [2024-11-16 22:49:27,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:27,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 22:49:27,550 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-16 22:49:27,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:49:27,717 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 22:49:27,752 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-16 22:49:27,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:49:27,879 INFO L204 MainTranslator]: Completed translation [2024-11-16 22:49:27,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27 WrapperNode [2024-11-16 22:49:27,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 22:49:27,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 22:49:27,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 22:49:27,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 22:49:27,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:27,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:27,975 INFO L138 Inliner]: procedures = 176, calls = 424, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1821 [2024-11-16 22:49:27,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 22:49:27,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 22:49:27,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 22:49:27,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 22:49:27,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:27,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:27,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:28,104 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-16 22:49:28,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:28,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:28,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:28,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:28,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:28,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:28,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 22:49:28,167 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 22:49:28,167 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 22:49:28,167 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 22:49:28,168 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (1/1) ... [2024-11-16 22:49:28,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:49:28,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:28,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 22:49:28,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 22:49:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 22:49:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 22:49:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 22:49:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 22:49:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 22:49:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 22:49:28,235 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 22:49:28,236 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 22:49:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 22:49:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 22:49:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 22:49:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 22:49:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 22:49:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 22:49:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 22:49:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 22:49:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 22:49:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 22:49:28,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 22:49:28,512 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 22:49:28,514 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 22:49:29,829 INFO L? ?]: Removed 419 outVars from TransFormulas that were not future-live. [2024-11-16 22:49:29,829 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 22:49:29,888 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 22:49:29,891 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-16 22:49:29,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:49:29 BoogieIcfgContainer [2024-11-16 22:49:29,892 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 22:49:29,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 22:49:29,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 22:49:29,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 22:49:29,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:49:27" (1/3) ... [2024-11-16 22:49:29,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd4920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:49:29, skipping insertion in model container [2024-11-16 22:49:29,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:27" (2/3) ... [2024-11-16 22:49:29,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd4920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:49:29, skipping insertion in model container [2024-11-16 22:49:29,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:49:29" (3/3) ... [2024-11-16 22:49:29,902 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-3.i [2024-11-16 22:49:29,915 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 22:49:29,915 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 22:49:29,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 22:49:29,993 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;@38b70c33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 22:49:29,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 22:49:29,999 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-16 22:49:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 22:49:30,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:30,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:49:30,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:30,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash 422595749, now seen corresponding path program 1 times [2024-11-16 22:49:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:30,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662012057] [2024-11-16 22:49:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:30,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:49:30,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:30,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662012057] [2024-11-16 22:49:30,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662012057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:30,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:30,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 22:49:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537614380] [2024-11-16 22:49:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:30,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 22:49:30,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:30,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 22:49:30,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 22:49:30,160 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-16 22:49:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:30,258 INFO L93 Difference]: Finished difference Result 939 states and 1508 transitions. [2024-11-16 22:49:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 22:49:30,260 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-16 22:49:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:30,269 INFO L225 Difference]: With dead ends: 939 [2024-11-16 22:49:30,270 INFO L226 Difference]: Without dead ends: 405 [2024-11-16 22:49:30,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 22:49:30,276 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-16 22:49:30,277 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-16 22:49:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-16 22:49:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-11-16 22:49:30,323 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-16 22:49:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 581 transitions. [2024-11-16 22:49:30,327 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 581 transitions. Word has length 11 [2024-11-16 22:49:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:30,327 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 581 transitions. [2024-11-16 22:49:30,327 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-16 22:49:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 581 transitions. [2024-11-16 22:49:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 22:49:30,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:30,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:49:30,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 22:49:30,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:30,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 45740209, now seen corresponding path program 1 times [2024-11-16 22:49:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:30,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025400068] [2024-11-16 22:49:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:49:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025400068] [2024-11-16 22:49:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025400068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:30,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:30,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:49:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876400909] [2024-11-16 22:49:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:49:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:30,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:49:30,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:49:30,464 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-16 22:49:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:30,830 INFO L93 Difference]: Finished difference Result 1134 states and 1641 transitions. [2024-11-16 22:49:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 22:49:30,830 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-16 22:49:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:30,833 INFO L225 Difference]: With dead ends: 1134 [2024-11-16 22:49:30,834 INFO L226 Difference]: Without dead ends: 729 [2024-11-16 22:49:30,834 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-16 22:49:30,835 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-16 22:49:30,836 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-16 22:49:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-16 22:49:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2024-11-16 22:49:30,858 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-16 22:49:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1058 transitions. [2024-11-16 22:49:30,860 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1058 transitions. Word has length 12 [2024-11-16 22:49:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:30,860 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1058 transitions. [2024-11-16 22:49:30,861 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-16 22:49:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1058 transitions. [2024-11-16 22:49:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 22:49:30,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:30,866 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-16 22:49:30,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 22:49:30,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1069999695, now seen corresponding path program 1 times [2024-11-16 22:49:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842787835] [2024-11-16 22:49:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:31,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 22:49:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 22:49:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:49:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842787835] [2024-11-16 22:49:31,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842787835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:31,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:31,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:49:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615934139] [2024-11-16 22:49:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:31,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:49:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:31,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:49:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:49:31,326 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-16 22:49:32,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:32,270 INFO L93 Difference]: Finished difference Result 1405 states and 2043 transitions. [2024-11-16 22:49:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:49:32,270 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-16 22:49:32,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:32,274 INFO L225 Difference]: With dead ends: 1405 [2024-11-16 22:49:32,274 INFO L226 Difference]: Without dead ends: 738 [2024-11-16 22:49:32,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:49:32,276 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 108 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:32,276 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.9s Time] [2024-11-16 22:49:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-16 22:49:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 729. [2024-11-16 22:49:32,292 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-16 22:49:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1044 transitions. [2024-11-16 22:49:32,295 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1044 transitions. Word has length 176 [2024-11-16 22:49:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:32,295 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1044 transitions. [2024-11-16 22:49:32,295 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-16 22:49:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1044 transitions. [2024-11-16 22:49:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 22:49:32,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:32,299 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-16 22:49:32,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 22:49:32,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:32,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1670760760, now seen corresponding path program 1 times [2024-11-16 22:49:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:32,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012898304] [2024-11-16 22:49:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:32,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 22:49:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:32,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 22:49:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:49:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012898304] [2024-11-16 22:49:32,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012898304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:32,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:32,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:49:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103570137] [2024-11-16 22:49:32,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:32,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:49:32,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:49:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:49:32,570 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-16 22:49:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:32,928 INFO L93 Difference]: Finished difference Result 1315 states and 1892 transitions. [2024-11-16 22:49:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 22:49:32,928 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-16 22:49:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:32,932 INFO L225 Difference]: With dead ends: 1315 [2024-11-16 22:49:32,933 INFO L226 Difference]: Without dead ends: 730 [2024-11-16 22:49:32,936 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-16 22:49:32,937 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-16 22:49:32,938 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-16 22:49:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-16 22:49:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 727. [2024-11-16 22:49:32,956 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-16 22:49:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1041 transitions. [2024-11-16 22:49:32,958 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1041 transitions. Word has length 176 [2024-11-16 22:49:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:32,959 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1041 transitions. [2024-11-16 22:49:32,959 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-16 22:49:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1041 transitions. [2024-11-16 22:49:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 22:49:32,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:32,963 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-16 22:49:32,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 22:49:32,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:32,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:32,965 INFO L85 PathProgramCache]: Analyzing trace with hash 888457815, now seen corresponding path program 1 times [2024-11-16 22:49:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151629239] [2024-11-16 22:49:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 22:49:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 22:49:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:33,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 22:49:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:33,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 22:49:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:33,330 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-16 22:49:33,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151629239] [2024-11-16 22:49:33,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151629239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:33,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:33,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:49:33,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346070032] [2024-11-16 22:49:33,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:33,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:49:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:33,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:49:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:49:33,332 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-16 22:49:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:33,718 INFO L93 Difference]: Finished difference Result 1173 states and 1683 transitions. [2024-11-16 22:49:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 22:49:33,718 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-16 22:49:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:33,721 INFO L225 Difference]: With dead ends: 1173 [2024-11-16 22:49:33,721 INFO L226 Difference]: Without dead ends: 646 [2024-11-16 22:49:33,722 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-16 22:49:33,723 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:33,723 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.4s Time] [2024-11-16 22:49:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-16 22:49:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 643. [2024-11-16 22:49:33,734 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-16 22:49:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 887 transitions. [2024-11-16 22:49:33,736 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 887 transitions. Word has length 191 [2024-11-16 22:49:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:33,737 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 887 transitions. [2024-11-16 22:49:33,737 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-16 22:49:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 887 transitions. [2024-11-16 22:49:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 22:49:33,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:33,739 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-16 22:49:33,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 22:49:33,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:33,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1715951394, now seen corresponding path program 1 times [2024-11-16 22:49:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227360176] [2024-11-16 22:49:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 22:49:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:34,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 22:49:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:34,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 22:49:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:34,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 22:49:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:34,702 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-16 22:49:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227360176] [2024-11-16 22:49:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227360176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:49:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320293230] [2024-11-16 22:49:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:34,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:34,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:49:34,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 22:49:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:35,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 22:49:35,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:49:35,227 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-16 22:49:35,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 22:49:35,651 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-16 22:49:35,851 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-16 22:49:35,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 22:49:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320293230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 22:49:35,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-16 22:49:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304608710] [2024-11-16 22:49:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:35,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 22:49:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:35,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 22:49:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-16 22:49:35,853 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-16 22:49:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:37,569 INFO L93 Difference]: Finished difference Result 1313 states and 1801 transitions. [2024-11-16 22:49:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 22:49:37,570 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-16 22:49:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:37,573 INFO L225 Difference]: With dead ends: 1313 [2024-11-16 22:49:37,573 INFO L226 Difference]: Without dead ends: 758 [2024-11-16 22:49:37,574 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-16 22:49:37,575 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 751 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:37,577 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.4s Time] [2024-11-16 22:49:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-16 22:49:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 674. [2024-11-16 22:49:37,593 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-16 22:49:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 925 transitions. [2024-11-16 22:49:37,595 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 925 transitions. Word has length 191 [2024-11-16 22:49:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:37,595 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 925 transitions. [2024-11-16 22:49:37,596 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-16 22:49:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 925 transitions. [2024-11-16 22:49:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 22:49:37,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:37,598 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-16 22:49:37,618 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-16 22:49:37,798 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-16 22:49:37,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:37,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1430815491, now seen corresponding path program 1 times [2024-11-16 22:49:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910961449] [2024-11-16 22:49:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 22:49:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 22:49:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 22:49:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 22:49:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,136 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-16 22:49:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:38,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910961449] [2024-11-16 22:49:38,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910961449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:38,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:38,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:49:38,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396064122] [2024-11-16 22:49:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:38,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:49:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:38,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:49:38,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:49:38,139 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-16 22:49:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:38,475 INFO L93 Difference]: Finished difference Result 1267 states and 1752 transitions. [2024-11-16 22:49:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 22:49:38,475 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-16 22:49:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:38,478 INFO L225 Difference]: With dead ends: 1267 [2024-11-16 22:49:38,478 INFO L226 Difference]: Without dead ends: 693 [2024-11-16 22:49:38,479 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-16 22:49:38,480 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 5 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:38,480 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.3s Time] [2024-11-16 22:49:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-16 22:49:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 688. [2024-11-16 22:49:38,496 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-16 22:49:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 937 transitions. [2024-11-16 22:49:38,498 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 937 transitions. Word has length 191 [2024-11-16 22:49:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:38,498 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 937 transitions. [2024-11-16 22:49:38,498 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-16 22:49:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 937 transitions. [2024-11-16 22:49:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 22:49:38,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:38,500 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-16 22:49:38,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 22:49:38,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:38,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2001847644, now seen corresponding path program 1 times [2024-11-16 22:49:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:38,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502384105] [2024-11-16 22:49:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 22:49:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 22:49:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 22:49:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 22:49:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:38,771 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-16 22:49:38,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502384105] [2024-11-16 22:49:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502384105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:38,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:49:38,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426634559] [2024-11-16 22:49:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:38,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:49:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:49:38,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:49:38,774 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-16 22:49:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:39,185 INFO L93 Difference]: Finished difference Result 1208 states and 1647 transitions. [2024-11-16 22:49:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 22:49:39,186 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-16 22:49:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:39,188 INFO L225 Difference]: With dead ends: 1208 [2024-11-16 22:49:39,188 INFO L226 Difference]: Without dead ends: 550 [2024-11-16 22:49:39,189 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-16 22:49:39,190 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 12 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:39,191 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.4s Time] [2024-11-16 22:49:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-16 22:49:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 547. [2024-11-16 22:49:39,208 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-16 22:49:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 726 transitions. [2024-11-16 22:49:39,210 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 726 transitions. Word has length 191 [2024-11-16 22:49:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:39,211 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 726 transitions. [2024-11-16 22:49:39,211 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-16 22:49:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 726 transitions. [2024-11-16 22:49:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 22:49:39,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:39,213 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-16 22:49:39,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 22:49:39,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:39,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash 715136957, now seen corresponding path program 1 times [2024-11-16 22:49:39,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:39,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134628182] [2024-11-16 22:49:39,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:39,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 22:49:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:40,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 22:49:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 22:49:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:40,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 22:49:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:40,026 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-16 22:49:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134628182] [2024-11-16 22:49:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134628182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:49:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190799069] [2024-11-16 22:49:40,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:40,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:49:40,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 22:49:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:40,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 22:49:40,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:49:40,556 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-16 22:49:40,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 22:49:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190799069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 22:49:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-16 22:49:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962793150] [2024-11-16 22:49:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:40,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:49:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:49:40,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 22:49:40,559 INFO L87 Difference]: Start difference. First operand 547 states and 726 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-16 22:49:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:40,726 INFO L93 Difference]: Finished difference Result 1054 states and 1410 transitions. [2024-11-16 22:49:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 22:49:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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 192 [2024-11-16 22:49:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:40,728 INFO L225 Difference]: With dead ends: 1054 [2024-11-16 22:49:40,728 INFO L226 Difference]: Without dead ends: 547 [2024-11-16 22:49:40,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 22:49:40,729 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 13 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:40,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1015 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 22:49:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-16 22:49:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2024-11-16 22:49:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 536 states have (on average 1.3171641791044777) internal successors, (706), 536 states have internal predecessors, (706), 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-16 22:49:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 724 transitions. [2024-11-16 22:49:40,743 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 724 transitions. Word has length 192 [2024-11-16 22:49:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:40,743 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 724 transitions. [2024-11-16 22:49:40,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-16 22:49:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 724 transitions. [2024-11-16 22:49:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-16 22:49:40,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:40,745 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-16 22:49:40,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 22:49:40,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 22:49:40,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:40,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:40,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1198741185, now seen corresponding path program 1 times [2024-11-16 22:49:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:40,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588216729] [2024-11-16 22:49:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:40,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 22:49:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 22:49:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 22:49:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-16 22:49:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:41,336 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-16 22:49:41,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:41,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588216729] [2024-11-16 22:49:41,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588216729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:41,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:41,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 22:49:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417014955] [2024-11-16 22:49:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 22:49:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:41,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 22:49:41,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 22:49:41,338 INFO L87 Difference]: Start difference. First operand 547 states and 724 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 6 states have internal predecessors, (176), 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-16 22:49:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:41,760 INFO L93 Difference]: Finished difference Result 1060 states and 1424 transitions. [2024-11-16 22:49:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 22:49:41,760 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), 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 193 [2024-11-16 22:49:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:41,762 INFO L225 Difference]: With dead ends: 1060 [2024-11-16 22:49:41,762 INFO L226 Difference]: Without dead ends: 556 [2024-11-16 22:49:41,763 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-16 22:49:41,764 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 7 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:41,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1603 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 22:49:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-16 22:49:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 553. [2024-11-16 22:49:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 542 states have (on average 1.3136531365313653) internal successors, (712), 542 states have internal predecessors, (712), 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-16 22:49:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 730 transitions. [2024-11-16 22:49:41,778 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 730 transitions. Word has length 193 [2024-11-16 22:49:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:41,778 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 730 transitions. [2024-11-16 22:49:41,779 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), 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-16 22:49:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 730 transitions. [2024-11-16 22:49:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 22:49:41,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:41,780 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-16 22:49:41,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 22:49:41,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:41,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 962945793, now seen corresponding path program 1 times [2024-11-16 22:49:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646342681] [2024-11-16 22:49:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 22:49:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:42,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 22:49:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-16 22:49:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 22:49:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:42,193 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-16 22:49:42,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:42,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646342681] [2024-11-16 22:49:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646342681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:42,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:42,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 22:49:42,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753898455] [2024-11-16 22:49:42,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:42,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 22:49:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 22:49:42,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 22:49:42,195 INFO L87 Difference]: Start difference. First operand 553 states and 730 transitions. Second operand has 8 states, 8 states have (on average 22.125) internal successors, (177), 7 states have internal predecessors, (177), 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-16 22:49:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:42,743 INFO L93 Difference]: Finished difference Result 1066 states and 1428 transitions. [2024-11-16 22:49:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 22:49:42,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.125) internal successors, (177), 7 states have internal predecessors, (177), 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 194 [2024-11-16 22:49:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:42,747 INFO L225 Difference]: With dead ends: 1066 [2024-11-16 22:49:42,747 INFO L226 Difference]: Without dead ends: 566 [2024-11-16 22:49:42,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 22:49:42,748 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 11 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:42,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2187 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 22:49:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-16 22:49:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 561. [2024-11-16 22:49:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 550 states have (on average 1.3127272727272727) internal successors, (722), 550 states have internal predecessors, (722), 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-16 22:49:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 740 transitions. [2024-11-16 22:49:42,761 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 740 transitions. Word has length 194 [2024-11-16 22:49:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:42,761 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 740 transitions. [2024-11-16 22:49:42,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.125) internal successors, (177), 7 states have internal predecessors, (177), 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-16 22:49:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 740 transitions. [2024-11-16 22:49:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 22:49:42,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:42,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, 1, 1, 1] [2024-11-16 22:49:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 22:49:42,763 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash -796958917, now seen corresponding path program 1 times [2024-11-16 22:49:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:42,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957951379] [2024-11-16 22:49:42,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 22:49:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 22:49:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-16 22:49:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:43,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-16 22:49:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:43,550 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-16 22:49:43,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957951379] [2024-11-16 22:49:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957951379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:49:43,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057569025] [2024-11-16 22:49:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:43,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:43,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:43,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:49:43,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 22:49:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:44,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 22:49:44,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:49:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 22:49:44,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 22:49:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057569025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 22:49:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-16 22:49:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922140070] [2024-11-16 22:49:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:44,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:49:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:44,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:49:44,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 22:49:44,152 INFO L87 Difference]: Start difference. First operand 561 states and 740 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 22:49:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:44,285 INFO L93 Difference]: Finished difference Result 1091 states and 1454 transitions. [2024-11-16 22:49:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:49:44,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 194 [2024-11-16 22:49:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:44,288 INFO L225 Difference]: With dead ends: 1091 [2024-11-16 22:49:44,288 INFO L226 Difference]: Without dead ends: 627 [2024-11-16 22:49:44,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 22:49:44,290 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 371 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:44,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1498 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:49:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-16 22:49:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 564. [2024-11-16 22:49:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 552 states have (on average 1.3134057971014492) internal successors, (725), 553 states have internal predecessors, (725), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-16 22:49:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 746 transitions. [2024-11-16 22:49:44,311 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 746 transitions. Word has length 194 [2024-11-16 22:49:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:44,311 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 746 transitions. [2024-11-16 22:49:44,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 22:49:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 746 transitions. [2024-11-16 22:49:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-16 22:49:44,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:44,313 INFO L215 NwaCegarLoop]: trace histogram [4, 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-16 22:49:44,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 22:49:44,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:44,518 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:44,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash -217175749, now seen corresponding path program 1 times [2024-11-16 22:49:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615635045] [2024-11-16 22:49:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 22:49:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 22:49:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 22:49:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 22:49:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-16 22:49:45,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615635045] [2024-11-16 22:49:45,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615635045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:49:45,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776678296] [2024-11-16 22:49:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:45,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:45,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:45,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:49:45,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 22:49:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:45,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 161 conjuncts are in the unsatisfiable core [2024-11-16 22:49:45,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:49:45,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 22:49:45,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-16 22:49:46,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-16 22:49:46,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2024-11-16 22:49:46,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-16 22:49:46,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 22:49:46,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-16 22:49:46,493 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-16 22:49:46,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-16 22:49:46,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 22:49:46,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 22:49:46,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-16 22:49:46,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-16 22:49:46,715 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-16 22:49:46,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-11-16 22:49:46,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-16 22:49:46,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-16 22:49:58,967 INFO L224 Elim1Store]: Index analysis took 1431 ms