./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c -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 e090762371efa1a10feb6b828109be17ddc5665dc90c03c64afd7f0f5af02942 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:15:41,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:15:41,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:15:41,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:15:41,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:15:41,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:15:41,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:15:41,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:15:41,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:15:41,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:15:41,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:15:41,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:15:41,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:15:41,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:15:41,161 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:15:41,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:15:41,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:15:41,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:15:41,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:15:41,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:15:41,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:15:41,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:15:41,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:15:41,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:15:41,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:15:41,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:15:41,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:15:41,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:15:41,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:15:41,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:15:41,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:15:41,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:15:41,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:15:41,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:15:41,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:15:41,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:15:41,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:15:41,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:15:41,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:15:41,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:15:41,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:15:41,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:15:41,175 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 -> e090762371efa1a10feb6b828109be17ddc5665dc90c03c64afd7f0f5af02942 [2024-10-24 00:15:41,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:15:41,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:15:41,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:15:41,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:15:41,438 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:15:41,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2024-10-24 00:15:42,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:15:42,932 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:15:42,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2024-10-24 00:15:42,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600f4bc51/9d2a7d8a365e421ca5a93d0caec5b043/FLAGcc12086cc [2024-10-24 00:15:42,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600f4bc51/9d2a7d8a365e421ca5a93d0caec5b043 [2024-10-24 00:15:42,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:15:42,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:15:42,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:15:42,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:15:42,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:15:42,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:15:42" (1/1) ... [2024-10-24 00:15:42,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57dfb747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:42, skipping insertion in model container [2024-10-24 00:15:42,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:15:42" (1/1) ... [2024-10-24 00:15:42,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:15:43,097 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c[546,559] [2024-10-24 00:15:43,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:15:43,116 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:15:43,125 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c[546,559] [2024-10-24 00:15:43,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:15:43,140 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:15:43,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43 WrapperNode [2024-10-24 00:15:43,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:15:43,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:15:43,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:15:43,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:15:43,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,164 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-10-24 00:15:43,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:15:43,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:15:43,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:15:43,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:15:43,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,181 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 00:15:43,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:15:43,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:15:43,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:15:43,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:15:43,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (1/1) ... [2024-10-24 00:15:43,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:15:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:15:43,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:15:43,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:15:43,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:15:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 00:15:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 00:15:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:15:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:15:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:15:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 00:15:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 00:15:43,304 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:15:43,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:15:43,438 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 00:15:43,438 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:15:43,472 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:15:43,473 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:15:43,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:15:43 BoogieIcfgContainer [2024-10-24 00:15:43,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:15:43,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:15:43,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:15:43,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:15:43,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:15:42" (1/3) ... [2024-10-24 00:15:43,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7c3864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:15:43, skipping insertion in model container [2024-10-24 00:15:43,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:43" (2/3) ... [2024-10-24 00:15:43,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7c3864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:15:43, skipping insertion in model container [2024-10-24 00:15:43,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:15:43" (3/3) ... [2024-10-24 00:15:43,483 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound2.c [2024-10-24 00:15:43,501 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:15:43,502 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:15:43,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:15:43,618 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;@30b89856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:15:43,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:15:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 00:15:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 00:15:43,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:15:43,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:15:43,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:15:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:15:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash -439153478, now seen corresponding path program 1 times [2024-10-24 00:15:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:15:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585506795] [2024-10-24 00:15:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:15:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:15:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:43,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:15:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:15:43,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:15:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585506795] [2024-10-24 00:15:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585506795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:15:43,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:15:43,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 00:15:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359797332] [2024-10-24 00:15:43,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:15:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:15:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:15:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:15:43,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:15:43,808 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 00:15:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:15:43,845 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2024-10-24 00:15:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:15:43,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-24 00:15:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:15:43,857 INFO L225 Difference]: With dead ends: 42 [2024-10-24 00:15:43,857 INFO L226 Difference]: Without dead ends: 20 [2024-10-24 00:15:43,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:15:43,869 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:15:43,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:15:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-24 00:15:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-24 00:15:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 00:15:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-24 00:15:43,898 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2024-10-24 00:15:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:15:43,898 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-24 00:15:43,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 00:15:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-10-24 00:15:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 00:15:43,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:15:43,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:15:43,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 00:15:43,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:15:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:15:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1801449375, now seen corresponding path program 1 times [2024-10-24 00:15:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:15:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208701190] [2024-10-24 00:15:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:15:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:15:43,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325080431] [2024-10-24 00:15:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:43,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:15:43,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:15:43,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:15:43,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:15:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 00:15:44,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:15:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:15:44,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:15:44,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:15:44,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208701190] [2024-10-24 00:15:44,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:15:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325080431] [2024-10-24 00:15:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325080431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:15:44,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:15:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:15:44,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117822686] [2024-10-24 00:15:44,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:15:44,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:15:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:15:44,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:15:44,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:15:44,101 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 00:15:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:15:44,137 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-24 00:15:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:15:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-24 00:15:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:15:44,138 INFO L225 Difference]: With dead ends: 31 [2024-10-24 00:15:44,138 INFO L226 Difference]: Without dead ends: 29 [2024-10-24 00:15:44,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-10-24 00:15:44,139 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:15:44,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:15:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-24 00:15:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-24 00:15:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 00:15:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-24 00:15:44,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-10-24 00:15:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:15:44,147 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-24 00:15:44,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 00:15:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-24 00:15:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 00:15:44,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:15:44,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:15:44,162 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-10-24 00:15:44,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:15:44,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:15:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:15:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -73181088, now seen corresponding path program 1 times [2024-10-24 00:15:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:15:44,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766732499] [2024-10-24 00:15:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:15:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:15:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:15:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:15:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:15:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766732499] [2024-10-24 00:15:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766732499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:15:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:15:44,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 00:15:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918009327] [2024-10-24 00:15:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:15:44,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 00:15:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:15:44,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 00:15:44,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:15:44,474 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 00:15:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:15:44,493 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-10-24 00:15:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 00:15:44,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-24 00:15:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:15:44,496 INFO L225 Difference]: With dead ends: 35 [2024-10-24 00:15:44,496 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 00:15:44,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:15:44,497 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:15:44,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:15:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 00:15:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-24 00:15:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 00:15:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-10-24 00:15:44,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2024-10-24 00:15:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:15:44,508 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-24 00:15:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 00:15:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-10-24 00:15:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 00:15:44,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:15:44,509 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] [2024-10-24 00:15:44,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 00:15:44,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:15:44,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:15:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 93929903, now seen corresponding path program 1 times [2024-10-24 00:15:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:15:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907534316] [2024-10-24 00:15:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:15:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:15:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:15:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:15:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:15:44,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:15:44,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907534316] [2024-10-24 00:15:44,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907534316] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:15:44,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170274986] [2024-10-24 00:15:44,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:44,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:15:44,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:15:44,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:15:44,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:15:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:44,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 00:15:44,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:15:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:15:45,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:15:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:15:45,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170274986] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:15:45,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:15:45,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-10-24 00:15:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297571514] [2024-10-24 00:15:45,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:15:45,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:15:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:15:45,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:15:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:15:45,215 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 12 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 00:15:49,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 00:15:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:15:49,301 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-10-24 00:15:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 00:15:49,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-10-24 00:15:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:15:49,303 INFO L225 Difference]: With dead ends: 41 [2024-10-24 00:15:49,303 INFO L226 Difference]: Without dead ends: 35 [2024-10-24 00:15:49,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:15:49,304 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:15:49,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 00:15:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-24 00:15:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-24 00:15:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 00:15:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-24 00:15:49,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 25 [2024-10-24 00:15:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:15:49,310 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-24 00:15:49,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 00:15:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-24 00:15:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 00:15:49,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:15:49,311 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:15:49,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:15:49,512 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,SelfDestructingSolverStorable3 [2024-10-24 00:15:49,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:15:49,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:15:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -870264245, now seen corresponding path program 1 times [2024-10-24 00:15:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:15:49,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106382386] [2024-10-24 00:15:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:15:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:49,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:15:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:49,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:15:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:49,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:15:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:15:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 00:15:49,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:15:49,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106382386] [2024-10-24 00:15:49,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106382386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:15:49,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803309403] [2024-10-24 00:15:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:49,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:15:49,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:15:49,619 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-10-24 00:15:49,620 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-10-24 00:15:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:49,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 00:15:49,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:15:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:15:49,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:15:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 00:15:49,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803309403] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:15:49,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:15:49,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 8 [2024-10-24 00:15:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134766120] [2024-10-24 00:15:49,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:15:49,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:15:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:15:49,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:15:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:15:49,774 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:15:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:15:49,821 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-10-24 00:15:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:15:49,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 34 [2024-10-24 00:15:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:15:49,823 INFO L225 Difference]: With dead ends: 46 [2024-10-24 00:15:49,823 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 00:15:49,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:15:49,824 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:15:49,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:15:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 00:15:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-24 00:15:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0) internal successors, (23), 23 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 00:15:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-10-24 00:15:49,835 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 34 [2024-10-24 00:15:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:15:49,835 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2024-10-24 00:15:49,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:15:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-10-24 00:15:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 00:15:49,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:15:49,837 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:15:49,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:15:50,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:15:50,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:15:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:15:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1291924684, now seen corresponding path program 1 times [2024-10-24 00:15:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:15:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495913809] [2024-10-24 00:15:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:15:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:15:50,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218900317] [2024-10-24 00:15:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:15:50,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:15:50,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:15:50,087 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-10-24 00:15:50,088 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-10-24 00:15:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:15:50,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 00:15:50,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:15:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 00:15:50,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:16:06,936 WARN L873 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615) 1) 18446744073709551616) 0))) is different from true [2024-10-24 00:16:34,240 WARN L286 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 00:16:38,276 WARN L873 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0))) is different from true [2024-10-24 00:17:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 8 not checked. [2024-10-24 00:17:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:17:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495913809] [2024-10-24 00:17:03,318 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:17:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218900317] [2024-10-24 00:17:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218900317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:17:03,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 00:17:03,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2024-10-24 00:17:03,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164898445] [2024-10-24 00:17:03,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 00:17:03,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 00:17:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:17:03,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 00:17:03,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=259, Unknown=3, NotChecked=66, Total=380 [2024-10-24 00:17:03,320 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 00:17:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:17:04,873 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2024-10-24 00:17:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:17:04,874 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 35 [2024-10-24 00:17:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:17:04,874 INFO L225 Difference]: With dead ends: 32 [2024-10-24 00:17:04,874 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 00:17:04,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=60, Invalid=287, Unknown=3, NotChecked=70, Total=420 [2024-10-24 00:17:04,875 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:17:04,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 110 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2024-10-24 00:17:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 00:17:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 00:17:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:17:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 00:17:04,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2024-10-24 00:17:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:17:04,877 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 00:17:04,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 00:17:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 00:17:04,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 00:17:04,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 00:17:04,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:17:05,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:17:05,086 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 00:17:05,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 00:17:05,247 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 00:17:05,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:17:05 BoogieIcfgContainer [2024-10-24 00:17:05,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 00:17:05,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 00:17:05,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 00:17:05,269 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 00:17:05,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:15:43" (3/4) ... [2024-10-24 00:17:05,270 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 00:17:05,273 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 00:17:05,273 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-24 00:17:05,277 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-24 00:17:05,277 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 00:17:05,277 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 00:17:05,277 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 00:17:05,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 00:17:05,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 00:17:05,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 00:17:05,345 INFO L158 Benchmark]: Toolchain (without parser) took 82389.33ms. Allocated memory is still 226.5MB. Free memory was 157.0MB in the beginning and 138.6MB in the end (delta: 18.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-24 00:17:05,346 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 136.3MB. Free memory was 103.5MB in the beginning and 103.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 00:17:05,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.61ms. Allocated memory is still 226.5MB. Free memory was 157.0MB in the beginning and 144.7MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 00:17:05,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.33ms. Allocated memory is still 226.5MB. Free memory was 144.5MB in the beginning and 143.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 00:17:05,346 INFO L158 Benchmark]: Boogie Preprocessor took 22.53ms. Allocated memory is still 226.5MB. Free memory was 143.1MB in the beginning and 141.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 00:17:05,347 INFO L158 Benchmark]: RCFGBuilder took 285.73ms. Allocated memory is still 226.5MB. Free memory was 141.3MB in the beginning and 129.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 00:17:05,347 INFO L158 Benchmark]: TraceAbstraction took 81792.03ms. Allocated memory is still 226.5MB. Free memory was 128.5MB in the beginning and 142.8MB in the end (delta: -14.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 00:17:05,348 INFO L158 Benchmark]: Witness Printer took 76.59ms. Allocated memory is still 226.5MB. Free memory was 142.8MB in the beginning and 138.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 00:17:05,349 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 136.3MB. Free memory was 103.5MB in the beginning and 103.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.61ms. Allocated memory is still 226.5MB. Free memory was 157.0MB in the beginning and 144.7MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.33ms. Allocated memory is still 226.5MB. Free memory was 144.5MB in the beginning and 143.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.53ms. Allocated memory is still 226.5MB. Free memory was 143.1MB in the beginning and 141.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.73ms. Allocated memory is still 226.5MB. Free memory was 141.3MB in the beginning and 129.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 81792.03ms. Allocated memory is still 226.5MB. Free memory was 128.5MB in the beginning and 142.8MB in the end (delta: -14.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 76.59ms. Allocated memory is still 226.5MB. Free memory was 142.8MB in the beginning and 138.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 45 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 237 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 115 mSDtfsCounter, 237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 197 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 74.2s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 291 ConstructedInterpolants, 1 QuantifiedInterpolants, 1128 SizeOfPredicates, 5 NumberOfNonLiveVariables, 358 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 103/136 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((y == ((long long) z * z)) && (1 <= counter)) && (x == ((long long) z + 1))) && (1 <= z)) || ((((y == z) && (x == 1)) && (counter == 0)) && (1 <= z))) || ((((2 <= counter) && (y == ((__int128) ((long long) z * z) * z))) && (x == (((long long) z + 1) + ((long long) z * z)))) && (1 <= z))) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == 0)) && (counter == \old(counter))) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond == 1) Ensures: ((cond == 1) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-10-24 00:17:05,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE