./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:21:38,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:21:38,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:21:38,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:21:38,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:21:38,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:21:38,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:21:38,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:21:38,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:21:38,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:21:38,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:21:38,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:21:38,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:21:38,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:21:38,393 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:21:38,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:21:38,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:21:38,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:21:38,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:21:38,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:21:38,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:21:38,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:21:38,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:21:38,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:21:38,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:21:38,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:21:38,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:21:38,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:21:38,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:21:38,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:21:38,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:21:38,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:21:38,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:21:38,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:21:38,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:21:38,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:21:38,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:21:38,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:21:38,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:21:38,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:21:38,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:21:38,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:21:38,404 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-10-13 09:21:38,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:21:38,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:21:38,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:21:38,681 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:21:38,681 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:21:38,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2024-10-13 09:21:40,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:21:40,435 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:21:40,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2024-10-13 09:21:40,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211063fb8/e31dbe772d3c472ea10ec2a8e73f3974/FLAGefdf16d46 [2024-10-13 09:21:40,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211063fb8/e31dbe772d3c472ea10ec2a8e73f3974 [2024-10-13 09:21:40,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:21:40,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:21:40,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:21:40,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:21:40,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:21:40,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:21:40" (1/1) ... [2024-10-13 09:21:40,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601383c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:40, skipping insertion in model container [2024-10-13 09:21:40,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:21:40" (1/1) ... [2024-10-13 09:21:40,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:21:40,864 WARN L248 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_SFH_nondet_test1-1.i[33519,33532] [2024-10-13 09:21:40,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:21:40,955 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:21:40,996 WARN L248 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_SFH_nondet_test1-1.i[33519,33532] [2024-10-13 09:21:41,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:21:41,104 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:21:41,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41 WrapperNode [2024-10-13 09:21:41,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:21:41,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:21:41,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:21:41,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:21:41,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,189 INFO L138 Inliner]: procedures = 176, calls = 169, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 797 [2024-10-13 09:21:41,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:21:41,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:21:41,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:21:41,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:21:41,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,267 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-10-13 09:21:41,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:21:41,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:21:41,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:21:41,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:21:41,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (1/1) ... [2024-10-13 09:21:41,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:21:41,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:21:41,377 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-10-13 09:21:41,414 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-10-13 09:21:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:21:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:21:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:21:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:21:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 09:21:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 09:21:41,465 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 09:21:41,465 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 09:21:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:21:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:21:41,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:21:41,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:21:41,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:21:42,704 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-10-13 09:21:42,704 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:21:42,740 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:21:42,740 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-13 09:21:42,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:21:42 BoogieIcfgContainer [2024-10-13 09:21:42,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:21:42,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:21:42,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:21:42,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:21:42,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:21:40" (1/3) ... [2024-10-13 09:21:42,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d74757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:21:42, skipping insertion in model container [2024-10-13 09:21:42,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:41" (2/3) ... [2024-10-13 09:21:42,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d74757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:21:42, skipping insertion in model container [2024-10-13 09:21:42,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:21:42" (3/3) ... [2024-10-13 09:21:42,749 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-1.i [2024-10-13 09:21:42,764 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:21:42,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 09:21:42,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:21:42,838 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;@22730321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:21:42,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 09:21:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 200 states have (on average 1.62) internal successors, (324), 201 states have internal predecessors, (324), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:21:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 09:21:42,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:42,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:42,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:21:42,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1125032957, now seen corresponding path program 1 times [2024-10-13 09:21:42,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417741634] [2024-10-13 09:21:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417741634] [2024-10-13 09:21:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417741634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:43,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:21:43,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680451872] [2024-10-13 09:21:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:43,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:21:43,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:21:43,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:21:43,058 INFO L87 Difference]: Start difference. First operand has 206 states, 200 states have (on average 1.62) internal successors, (324), 201 states have internal predecessors, (324), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 09:21:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:43,168 INFO L93 Difference]: Finished difference Result 411 states and 659 transitions. [2024-10-13 09:21:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:21:43,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-13 09:21:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:43,183 INFO L225 Difference]: With dead ends: 411 [2024-10-13 09:21:43,184 INFO L226 Difference]: Without dead ends: 204 [2024-10-13 09:21:43,187 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-10-13 09:21:43,192 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:43,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:21:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-13 09:21:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-13 09:21:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.4371859296482412) internal successors, (286), 199 states have internal predecessors, (286), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:21:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 292 transitions. [2024-10-13 09:21:43,238 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 292 transitions. Word has length 7 [2024-10-13 09:21:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:43,238 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 292 transitions. [2024-10-13 09:21:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 09:21:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 292 transitions. [2024-10-13 09:21:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 09:21:43,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:43,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:43,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:21:43,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:21:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -692801208, now seen corresponding path program 1 times [2024-10-13 09:21:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361796597] [2024-10-13 09:21:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:43,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:43,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361796597] [2024-10-13 09:21:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361796597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:43,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:43,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:21:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176635088] [2024-10-13 09:21:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:43,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:21:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:43,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:21:43,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:21:43,305 INFO L87 Difference]: Start difference. First operand 204 states and 292 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 09:21:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:43,365 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2024-10-13 09:21:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:21:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-13 09:21:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:43,373 INFO L225 Difference]: With dead ends: 404 [2024-10-13 09:21:43,373 INFO L226 Difference]: Without dead ends: 398 [2024-10-13 09:21:43,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:21:43,375 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 274 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:43,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 614 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:21:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-13 09:21:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 205. [2024-10-13 09:21:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.435) internal successors, (287), 200 states have internal predecessors, (287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:21:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 293 transitions. [2024-10-13 09:21:43,398 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 293 transitions. Word has length 7 [2024-10-13 09:21:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:43,398 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 293 transitions. [2024-10-13 09:21:43,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 09:21:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2024-10-13 09:21:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 09:21:43,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:43,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:43,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:21:43,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:21:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1078552354, now seen corresponding path program 1 times [2024-10-13 09:21:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106896897] [2024-10-13 09:21:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:43,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:43,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106896897] [2024-10-13 09:21:43,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106896897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:43,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:43,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:21:43,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241540938] [2024-10-13 09:21:43,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:43,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:21:43,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:43,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:21:43,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:21:43,900 INFO L87 Difference]: Start difference. First operand 205 states and 293 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-10-13 09:21:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:44,023 INFO L93 Difference]: Finished difference Result 411 states and 587 transitions. [2024-10-13 09:21:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:21:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2024-10-13 09:21:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:44,029 INFO L225 Difference]: With dead ends: 411 [2024-10-13 09:21:44,030 INFO L226 Difference]: Without dead ends: 208 [2024-10-13 09:21:44,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:21:44,034 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 105 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:44,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 692 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:21:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-13 09:21:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2024-10-13 09:21:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.4) internal successors, (280), 200 states have internal predecessors, (280), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:21:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2024-10-13 09:21:44,051 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 82 [2024-10-13 09:21:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:44,051 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2024-10-13 09:21:44,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-10-13 09:21:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2024-10-13 09:21:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 09:21:44,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:44,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:44,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:21:44,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:21:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1061741358, now seen corresponding path program 1 times [2024-10-13 09:21:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634895896] [2024-10-13 09:21:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634895896] [2024-10-13 09:21:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634895896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:21:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426595134] [2024-10-13 09:21:44,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:21:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:21:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:21:44,295 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-10-13 09:21:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:44,352 INFO L93 Difference]: Finished difference Result 537 states and 759 transitions. [2024-10-13 09:21:44,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:21:44,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 82 [2024-10-13 09:21:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:44,355 INFO L225 Difference]: With dead ends: 537 [2024-10-13 09:21:44,355 INFO L226 Difference]: Without dead ends: 334 [2024-10-13 09:21:44,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:21:44,360 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 134 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:44,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 555 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:21:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-13 09:21:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-10-13 09:21:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 329 states have (on average 1.4224924012158056) internal successors, (468), 329 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:21:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 474 transitions. [2024-10-13 09:21:44,390 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 474 transitions. Word has length 82 [2024-10-13 09:21:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:44,390 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 474 transitions. [2024-10-13 09:21:44,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-10-13 09:21:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 474 transitions. [2024-10-13 09:21:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 09:21:44,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:44,396 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 09:21:44,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:21:44,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:21:44,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1601131103, now seen corresponding path program 1 times [2024-10-13 09:21:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146286260] [2024-10-13 09:21:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:21:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:44,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:21:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:21:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:44,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146286260] [2024-10-13 09:21:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146286260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:21:44,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919008178] [2024-10-13 09:21:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:44,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:21:44,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:21:44,675 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-10-13 09:21:44,677 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-10-13 09:21:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:45,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 09:21:45,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:21:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:21:45,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:21:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:21:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919008178] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:21:45,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:21:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2024-10-13 09:21:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549448437] [2024-10-13 09:21:45,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:21:45,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:21:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:21:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:21:45,423 INFO L87 Difference]: Start difference. First operand 334 states and 474 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 09:21:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:45,761 INFO L93 Difference]: Finished difference Result 793 states and 1128 transitions. [2024-10-13 09:21:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:21:45,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 95 [2024-10-13 09:21:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:45,770 INFO L225 Difference]: With dead ends: 793 [2024-10-13 09:21:45,771 INFO L226 Difference]: Without dead ends: 787 [2024-10-13 09:21:45,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:21:45,773 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1717 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:45,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 1386 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:21:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-13 09:21:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2024-10-13 09:21:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 771 states have (on average 1.4020752269779506) internal successors, (1081), 771 states have internal predecessors, (1081), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:21:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1105 transitions. [2024-10-13 09:21:45,814 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1105 transitions. Word has length 95 [2024-10-13 09:21:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:45,816 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1105 transitions. [2024-10-13 09:21:45,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 09:21:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1105 transitions. [2024-10-13 09:21:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-13 09:21:45,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:45,830 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:45,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:21:46,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:21:46,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:21:46,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1508188597, now seen corresponding path program 1 times [2024-10-13 09:21:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:46,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229526221] [2024-10-13 09:21:46,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:46,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:21:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:21:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 4 proven. 162 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-10-13 09:21:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229526221] [2024-10-13 09:21:46,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229526221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:21:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895325689] [2024-10-13 09:21:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:46,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:21:46,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:21:46,793 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-10-13 09:21:46,799 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-10-13 09:21:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:47,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 09:21:47,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:21:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 448 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:21:47,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:21:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 448 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:21:48,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895325689] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:21:48,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:21:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-10-13 09:21:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583917138] [2024-10-13 09:21:48,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:21:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 09:21:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 09:21:48,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-10-13 09:21:48,340 INFO L87 Difference]: Start difference. First operand 785 states and 1105 transitions. Second operand has 15 states, 15 states have (on average 50.86666666666667) internal successors, (763), 14 states have internal predecessors, (763), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:21:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:49,634 INFO L93 Difference]: Finished difference Result 2331 states and 3313 transitions. [2024-10-13 09:21:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 09:21:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 50.86666666666667) internal successors, (763), 14 states have internal predecessors, (763), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 320 [2024-10-13 09:21:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:49,644 INFO L225 Difference]: With dead ends: 2331 [2024-10-13 09:21:49,644 INFO L226 Difference]: Without dead ends: 1871 [2024-10-13 09:21:49,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2024-10-13 09:21:49,647 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 7329 mSDsluCounter, 2771 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7329 SdHoareTripleChecker+Valid, 3262 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:49,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7329 Valid, 3262 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 09:21:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-10-13 09:21:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1869. [2024-10-13 09:21:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1855 states have (on average 1.411320754716981) internal successors, (2618), 1855 states have internal predecessors, (2618), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:21:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2642 transitions. [2024-10-13 09:21:49,695 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2642 transitions. Word has length 320 [2024-10-13 09:21:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:49,696 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2642 transitions. [2024-10-13 09:21:49,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.86666666666667) internal successors, (763), 14 states have internal predecessors, (763), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:21:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2642 transitions. [2024-10-13 09:21:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2024-10-13 09:21:49,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:49,713 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:49,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 09:21:49,917 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,SelfDestructingSolverStorable5 [2024-10-13 09:21:49,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:21:49,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1464386246, now seen corresponding path program 1 times [2024-10-13 09:21:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852376210] [2024-10-13 09:21:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms