./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.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/heap-manipulation/dancing.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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:29:45,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:29:45,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:29:45,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:29:45,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:29:45,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:29:45,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:29:45,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:29:45,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:29:45,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:29:45,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:29:45,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:29:45,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:29:45,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:29:45,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:29:45,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:29:45,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:29:45,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:29:45,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:29:45,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:29:45,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:29:45,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:29:45,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:29:45,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:29:45,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:29:45,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:29:45,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:29:45,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:29:45,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:29:45,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:29:45,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:29:45,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:29:45,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:29:45,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:29:45,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:29:45,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:29:45,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:29:45,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:29:45,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:29:45,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:29:45,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:29:45,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:29:45,275 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2024-11-16 06:29:45,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:29:45,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:29:45,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:29:45,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:29:45,556 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:29:45,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-16 06:29:47,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:29:47,269 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:29:47,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-16 06:29:47,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34f4fb97/c71a43ca7b2a434b8520fd9834b40b78/FLAG644c4c803 [2024-11-16 06:29:47,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34f4fb97/c71a43ca7b2a434b8520fd9834b40b78 [2024-11-16 06:29:47,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:29:47,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:29:47,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:29:47,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:29:47,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:29:47,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:29:47" (1/1) ... [2024-11-16 06:29:47,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c14d7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:47, skipping insertion in model container [2024-11-16 06:29:47,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:29:47" (1/1) ... [2024-11-16 06:29:47,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:29:47,903 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/heap-manipulation/dancing.i[938,951] [2024-11-16 06:29:48,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:29:48,074 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:29:48,087 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/heap-manipulation/dancing.i[938,951] [2024-11-16 06:29:48,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:29:48,150 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:29:48,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48 WrapperNode [2024-11-16 06:29:48,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:29:48,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:29:48,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:29:48,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:29:48,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,194 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 87 [2024-11-16 06:29:48,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:29:48,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:29:48,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:29:48,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:29:48,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,228 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-16 06:29:48,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:29:48,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:29:48,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:29:48,244 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:29:48,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (1/1) ... [2024-11-16 06:29:48,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:29:48,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:29:48,284 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 06:29:48,288 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 06:29:48,341 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2024-11-16 06:29:48,342 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2024-11-16 06:29:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 06:29:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 06:29:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:29:48,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 06:29:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:29:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:29:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:29:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:29:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:29:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:29:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:29:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:29:48,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:29:48,491 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:29:48,493 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:29:48,716 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L603: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2024-11-16 06:29:48,753 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-16 06:29:48,754 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:29:48,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:29:48,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:29:48,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:29:48 BoogieIcfgContainer [2024-11-16 06:29:48,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:29:48,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:29:48,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:29:48,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:29:48,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:29:47" (1/3) ... [2024-11-16 06:29:48,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6f1e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:29:48, skipping insertion in model container [2024-11-16 06:29:48,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:29:48" (2/3) ... [2024-11-16 06:29:48,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6f1e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:29:48, skipping insertion in model container [2024-11-16 06:29:48,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:29:48" (3/3) ... [2024-11-16 06:29:48,774 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2024-11-16 06:29:48,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:29:48,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:29:48,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:29:48,854 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;@2c949288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:29:48,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:29:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 06:29:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 06:29:48,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:48,867 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] [2024-11-16 06:29:48,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:48,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash -759429417, now seen corresponding path program 1 times [2024-11-16 06:29:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79459217] [2024-11-16 06:29:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:48,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:29:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:49,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 06:29:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79459217] [2024-11-16 06:29:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79459217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:29:49,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:29:49,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:29:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079144228] [2024-11-16 06:29:49,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:29:49,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:29:49,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:29:49,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:29:49,164 INFO L87 Difference]: Start difference. First operand has 45 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:29:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:29:49,182 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-11-16 06:29:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:29:49,184 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-16 06:29:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:29:49,192 INFO L225 Difference]: With dead ends: 82 [2024-11-16 06:29:49,192 INFO L226 Difference]: Without dead ends: 40 [2024-11-16 06:29:49,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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 06:29:49,201 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:29:49,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:29:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-16 06:29:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-16 06:29:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 06:29:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-16 06:29:49,246 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 21 [2024-11-16 06:29:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:29:49,247 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-16 06:29:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:29:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-16 06:29:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 06:29:49,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:49,249 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] [2024-11-16 06:29:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:29:49,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:49,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1917745598, now seen corresponding path program 1 times [2024-11-16 06:29:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:49,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778629136] [2024-11-16 06:29:49,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:49,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:49,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:29:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:49,578 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 06:29:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778629136] [2024-11-16 06:29:49,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778629136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:29:49,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:29:49,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:29:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849696548] [2024-11-16 06:29:49,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:29:49,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:29:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:49,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:29:49,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:29:49,582 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:29:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:29:49,644 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-16 06:29:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:29:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-16 06:29:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:29:49,647 INFO L225 Difference]: With dead ends: 49 [2024-11-16 06:29:49,647 INFO L226 Difference]: Without dead ends: 46 [2024-11-16 06:29:49,648 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 06:29:49,649 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:29:49,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 193 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:29:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-16 06:29:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-11-16 06:29:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 36 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 06:29:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-11-16 06:29:49,664 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 22 [2024-11-16 06:29:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:29:49,665 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-11-16 06:29:49,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:29:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-11-16 06:29:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 06:29:49,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:49,668 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 06:29:49,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:29:49,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:49,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:49,671 INFO L85 PathProgramCache]: Analyzing trace with hash -733028504, now seen corresponding path program 1 times [2024-11-16 06:29:49,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:49,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833015510] [2024-11-16 06:29:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:49,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:29:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 06:29:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 06:29:49,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:49,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833015510] [2024-11-16 06:29:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833015510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:29:49,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:29:49,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:29:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269354813] [2024-11-16 06:29:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:29:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:29:49,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:49,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:29:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:29:49,820 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:29:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:29:49,875 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2024-11-16 06:29:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:29:49,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-16 06:29:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:29:49,880 INFO L225 Difference]: With dead ends: 92 [2024-11-16 06:29:49,880 INFO L226 Difference]: Without dead ends: 68 [2024-11-16 06:29:49,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:29:49,883 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:29:49,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:29:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-16 06:29:49,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-11-16 06:29:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 49 states have internal predecessors, (63), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 06:29:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2024-11-16 06:29:49,901 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 28 [2024-11-16 06:29:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:29:49,901 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2024-11-16 06:29:49,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:29:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-11-16 06:29:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 06:29:49,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:49,904 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] [2024-11-16 06:29:49,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:29:49,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2135176247, now seen corresponding path program 1 times [2024-11-16 06:29:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:49,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411588696] [2024-11-16 06:29:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:49,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 06:29:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:50,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:29:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:29:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:50,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411588696] [2024-11-16 06:29:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411588696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:29:50,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666612973] [2024-11-16 06:29:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:50,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:29:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:29:50,136 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 06:29:50,152 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 06:29:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:50,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 06:29:50,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:29:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:29:50,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:29:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:29:50,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666612973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:29:50,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:29:50,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-16 06:29:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018248761] [2024-11-16 06:29:50,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:29:50,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 06:29:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:50,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 06:29:50,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:29:50,741 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 06:29:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:29:51,039 INFO L93 Difference]: Finished difference Result 109 states and 151 transitions. [2024-11-16 06:29:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 06:29:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2024-11-16 06:29:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:29:51,043 INFO L225 Difference]: With dead ends: 109 [2024-11-16 06:29:51,043 INFO L226 Difference]: Without dead ends: 72 [2024-11-16 06:29:51,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-16 06:29:51,045 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 82 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:29:51,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 362 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:29:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-16 06:29:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-11-16 06:29:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 57 states have internal predecessors, (71), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-16 06:29:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2024-11-16 06:29:51,056 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 33 [2024-11-16 06:29:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:29:51,057 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2024-11-16 06:29:51,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 06:29:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2024-11-16 06:29:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 06:29:51,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:51,060 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-16 06:29:51,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 06:29:51,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:29:51,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:51,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2017766935, now seen corresponding path program 1 times [2024-11-16 06:29:51,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:51,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704128714] [2024-11-16 06:29:51,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:51,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 06:29:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 06:29:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 06:29:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704128714] [2024-11-16 06:29:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704128714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:29:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:29:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 06:29:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112279716] [2024-11-16 06:29:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:29:51,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:29:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:29:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:29:51,484 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 06:29:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:29:51,542 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2024-11-16 06:29:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:29:51,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-16 06:29:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:29:51,544 INFO L225 Difference]: With dead ends: 80 [2024-11-16 06:29:51,547 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 06:29:51,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:29:51,548 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:29:51,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 306 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:29:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 06:29:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-16 06:29:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 63 states have internal predecessors, (76), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2024-11-16 06:29:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2024-11-16 06:29:51,572 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 35 [2024-11-16 06:29:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:29:51,572 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2024-11-16 06:29:51,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 06:29:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2024-11-16 06:29:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 06:29:51,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:51,576 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] [2024-11-16 06:29:51,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 06:29:51,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:51,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1797187153, now seen corresponding path program 1 times [2024-11-16 06:29:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860710321] [2024-11-16 06:29:51,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:29:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 06:29:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 06:29:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:29:51,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:51,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860710321] [2024-11-16 06:29:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860710321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:29:51,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:29:51,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 06:29:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22000114] [2024-11-16 06:29:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:29:51,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 06:29:51,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:51,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 06:29:51,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:29:51,742 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:29:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:29:51,777 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2024-11-16 06:29:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:29:51,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-16 06:29:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:29:51,778 INFO L225 Difference]: With dead ends: 84 [2024-11-16 06:29:51,779 INFO L226 Difference]: Without dead ends: 76 [2024-11-16 06:29:51,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:29:51,780 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:29:51,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 259 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:29:51,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-16 06:29:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2024-11-16 06:29:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.32) internal successors, (66), 53 states have internal predecessors, (66), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-16 06:29:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2024-11-16 06:29:51,800 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 37 [2024-11-16 06:29:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:29:51,800 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2024-11-16 06:29:51,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:29:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-11-16 06:29:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 06:29:51,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:51,802 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 06:29:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 06:29:51,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:51,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2042109610, now seen corresponding path program 1 times [2024-11-16 06:29:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541003208] [2024-11-16 06:29:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:51,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:29:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 06:29:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 06:29:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:29:51,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541003208] [2024-11-16 06:29:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541003208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:29:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:29:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:29:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095972128] [2024-11-16 06:29:51,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:29:51,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:29:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:51,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:29:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:29:51,973 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:29:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:29:52,063 INFO L93 Difference]: Finished difference Result 109 states and 145 transitions. [2024-11-16 06:29:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:29:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-16 06:29:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:29:52,064 INFO L225 Difference]: With dead ends: 109 [2024-11-16 06:29:52,065 INFO L226 Difference]: Without dead ends: 55 [2024-11-16 06:29:52,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 06:29:52,066 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:29:52,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:29:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-16 06:29:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-16 06:29:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 45 states have internal predecessors, (54), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-16 06:29:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-11-16 06:29:52,078 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 38 [2024-11-16 06:29:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:29:52,078 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-11-16 06:29:52,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 06:29:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-11-16 06:29:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 06:29:52,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:52,080 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-16 06:29:52,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 06:29:52,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:52,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash -353915725, now seen corresponding path program 1 times [2024-11-16 06:29:52,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:52,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318219950] [2024-11-16 06:29:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:52,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 06:29:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 06:29:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:29:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 06:29:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318219950] [2024-11-16 06:29:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318219950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:29:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196390549] [2024-11-16 06:29:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:52,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:29:52,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:29:52,550 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 06:29:52,551 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 06:29:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:52,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-16 06:29:52,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:29:52,741 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-16 06:29:52,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-16 06:29:52,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:29:52,772 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 18 treesize of output 13 [2024-11-16 06:29:52,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:29:52,777 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 18 treesize of output 13 [2024-11-16 06:29:52,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-16 06:29:52,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-16 06:29:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 06:29:53,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:29:53,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-16 06:29:53,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:53,161 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-16 06:29:53,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-16 06:29:53,174 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-16 06:29:53,175 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-16 06:29:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 06:29:53,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196390549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:29:53,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:29:53,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 17 [2024-11-16 06:29:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541678432] [2024-11-16 06:29:53,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:29:53,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 06:29:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:53,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 06:29:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-16 06:29:53,216 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 06:29:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:29:53,841 INFO L93 Difference]: Finished difference Result 145 states and 188 transitions. [2024-11-16 06:29:53,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 06:29:53,841 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 41 [2024-11-16 06:29:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:29:53,843 INFO L225 Difference]: With dead ends: 145 [2024-11-16 06:29:53,843 INFO L226 Difference]: Without dead ends: 107 [2024-11-16 06:29:53,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2024-11-16 06:29:53,845 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 129 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:29:53,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 598 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 06:29:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-16 06:29:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2024-11-16 06:29:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 82 states have internal predecessors, (97), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2024-11-16 06:29:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2024-11-16 06:29:53,876 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 41 [2024-11-16 06:29:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:29:53,877 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2024-11-16 06:29:53,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 06:29:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2024-11-16 06:29:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 06:29:53,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:29:53,878 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-16 06:29:53,896 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-11-16 06:29:54,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-16 06:29:54,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:29:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:29:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 679497843, now seen corresponding path program 1 times [2024-11-16 06:29:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:29:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507553953] [2024-11-16 06:29:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:29:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:54,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 06:29:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 06:29:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:29:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 06:29:54,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:29:54,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507553953] [2024-11-16 06:29:54,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507553953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:29:54,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090251647] [2024-11-16 06:29:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:29:54,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:29:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:29:54,210 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 06:29:54,212 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 06:29:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:29:54,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-16 06:29:54,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:29:54,416 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-16 06:29:54,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:29:54,421 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 16 treesize of output 11 [2024-11-16 06:29:54,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-16 06:29:54,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:29:54,432 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 25 treesize of output 18 [2024-11-16 06:29:54,861 INFO L349 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2024-11-16 06:29:54,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 33 [2024-11-16 06:29:54,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-11-16 06:29:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:29:55,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:29:55,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:55,812 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 92 [2024-11-16 06:29:55,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:55,824 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 66 [2024-11-16 06:29:55,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:55,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 711 treesize of output 707 [2024-11-16 06:29:55,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 449 treesize of output 415 [2024-11-16 06:29:55,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:55,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 363 treesize of output 331 [2024-11-16 06:29:55,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 252 [2024-11-16 06:29:56,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:56,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 9 [2024-11-16 06:29:56,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-16 06:29:56,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:56,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 9 [2024-11-16 06:29:56,641 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:29:56,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-16 06:29:56,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-16 06:29:56,682 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:29:56,687 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:29:56,692 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:29:57,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-16 06:29:57,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:57,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 9 [2024-11-16 06:29:57,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:57,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 9 [2024-11-16 06:29:57,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:57,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 9 [2024-11-16 06:29:57,064 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:29:57,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-16 06:29:57,079 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:29:57,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-16 06:29:57,116 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:29:57,134 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2024-11-16 06:29:57,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 26 [2024-11-16 06:29:57,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:29:57,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 91 [2024-11-16 06:29:57,196 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:29:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:29:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090251647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:29:57,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:29:57,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 14] total 31 [2024-11-16 06:29:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540874055] [2024-11-16 06:29:57,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:29:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-16 06:29:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:29:57,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-16 06:29:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2024-11-16 06:29:57,292 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand has 31 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 06:30:01,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:30:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:30:04,338 INFO L93 Difference]: Finished difference Result 246 states and 324 transitions. [2024-11-16 06:30:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-16 06:30:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 41 [2024-11-16 06:30:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:30:04,340 INFO L225 Difference]: With dead ends: 246 [2024-11-16 06:30:04,340 INFO L226 Difference]: Without dead ends: 157 [2024-11-16 06:30:04,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=352, Invalid=3188, Unknown=0, NotChecked=0, Total=3540 [2024-11-16 06:30:04,345 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 156 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-16 06:30:04,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1330 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1378 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-11-16 06:30:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-16 06:30:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 136. [2024-11-16 06:30:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 108 states have internal predecessors, (124), 20 states have call successors, (20), 9 states have call predecessors, (20), 16 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) [2024-11-16 06:30:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2024-11-16 06:30:04,379 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 41 [2024-11-16 06:30:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:30:04,379 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2024-11-16 06:30:04,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 8 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 06:30:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2024-11-16 06:30:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 06:30:04,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:30:04,380 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 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] [2024-11-16 06:30:04,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 06:30:04,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:30:04,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:30:04,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:30:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1576397202, now seen corresponding path program 1 times [2024-11-16 06:30:04,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:30:04,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562932168] [2024-11-16 06:30:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:30:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:30:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:30:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:30:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:30:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:30:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:30:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 06:30:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:30:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 06:30:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:30:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 06:30:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:30:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562932168] [2024-11-16 06:30:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562932168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:30:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249639882] [2024-11-16 06:30:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:30:05,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:30:05,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:30:05,222 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 06:30:05,223 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 06:30:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:30:05,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-16 06:30:05,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:30:05,397 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 20 treesize of output 9 [2024-11-16 06:30:05,430 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 06:30:05,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:30:05,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:30:05,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2024-11-16 06:30:05,489 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-16 06:30:05,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 32 [2024-11-16 06:30:05,601 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-16 06:30:05,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-16 06:30:05,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:30:05,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:30:05,660 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 42 treesize of output 39 [2024-11-16 06:30:05,679 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-16 06:30:05,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 21 [2024-11-16 06:30:09,866 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_5| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_7|))) (and (<= (+ 2 (select .cse0 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_7|) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_5| 4)) 0)))) (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_5| Int)) (<= (+ (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_5| 4)) 2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_7|))) is different from true [2024-11-16 06:31:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2024-11-16 06:31:15,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:31:25,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-16 06:31:25,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_22| Int) (v_ArrVal_485 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_487 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_24| 1)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~n~0#1.base_24| v_ArrVal_483))) (store (store .cse0 |v_ULTIMATE.start_main_~n~0#1.base_22| v_ArrVal_487) |c_ULTIMATE.start_main_~tail~0#1.base| (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select (store (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_485)) |v_ULTIMATE.start_main_~n~0#1.base_22| v_ArrVal_487) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |v_ULTIMATE.start_main_~n~0#1.base_22|)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) |v_ULTIMATE.start_main_~n~0#1.base_24|)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| 0) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |v_ULTIMATE.start_main_~n~0#1.base_22|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_22| 1)))) is different from false [2024-11-16 06:31:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2024-11-16 06:31:25,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249639882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:31:25,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:31:25,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 13] total 41 [2024-11-16 06:31:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628114354] [2024-11-16 06:31:25,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:31:25,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-16 06:31:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:31:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-16 06:31:25,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1329, Unknown=26, NotChecked=150, Total=1640 [2024-11-16 06:31:25,750 INFO L87 Difference]: Start difference. First operand 136 states and 174 transitions. Second operand has 41 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 39 states have internal predecessors, (105), 10 states have call successors, (12), 4 states have call predecessors, (12), 8 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11)