./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-1.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/recursive-simple/id_i5_o5-1.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 019a1f0c8a0db266ae045e6c9616b1be3853f9265d9110ea0f95df9172dad7ef --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:06:44,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:06:44,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:06:44,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:06:44,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:06:44,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:06:44,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:06:44,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:06:44,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:06:44,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:06:44,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:06:44,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:06:44,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:06:44,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:06:44,820 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:06:44,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:06:44,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:06:44,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:06:44,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:06:44,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:06:44,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:06:44,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:06:44,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:06:44,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:06:44,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:06:44,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:06:44,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:06:44,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:06:44,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:06:44,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:06:44,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:06:44,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:06:44,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:06:44,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:06:44,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:06:44,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:06:44,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:06:44,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:06:44,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:06:44,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:06:44,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:06:44,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:06:44,830 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 -> 019a1f0c8a0db266ae045e6c9616b1be3853f9265d9110ea0f95df9172dad7ef [2024-10-24 01:06:45,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:06:45,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:06:45,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:06:45,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:06:45,159 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:06:45,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-1.c [2024-10-24 01:06:46,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:06:46,787 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:06:46,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-1.c [2024-10-24 01:06:46,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2384996d9/8ee99de31657423c883a8f9e54e4936e/FLAGd529bd552 [2024-10-24 01:06:46,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2384996d9/8ee99de31657423c883a8f9e54e4936e [2024-10-24 01:06:46,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:06:46,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:06:46,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:06:46,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:06:46,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:06:46,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:06:46" (1/1) ... [2024-10-24 01:06:46,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d18bfdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:46, skipping insertion in model container [2024-10-24 01:06:46,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:06:46" (1/1) ... [2024-10-24 01:06:46,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:06:46,990 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/recursive-simple/id_i5_o5-1.c[450,463] [2024-10-24 01:06:46,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:06:47,006 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:06:47,017 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/recursive-simple/id_i5_o5-1.c[450,463] [2024-10-24 01:06:47,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:06:47,034 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:06:47,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47 WrapperNode [2024-10-24 01:06:47,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:06:47,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:06:47,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:06:47,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:06:47,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,062 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2024-10-24 01:06:47,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:06:47,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:06:47,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:06:47,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:06:47,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,081 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 01:06:47,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:06:47,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:06:47,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:06:47,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:06:47,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (1/1) ... [2024-10-24 01:06:47,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:06:47,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:06:47,117 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 01:06:47,119 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 01:06:47,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:06:47,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:06:47,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:06:47,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:06:47,157 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-10-24 01:06:47,157 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-10-24 01:06:47,207 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:06:47,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:06:47,290 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-24 01:06:47,290 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:06:47,323 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:06:47,324 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:06:47,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:06:47 BoogieIcfgContainer [2024-10-24 01:06:47,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:06:47,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:06:47,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:06:47,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:06:47,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:06:46" (1/3) ... [2024-10-24 01:06:47,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a381c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:06:47, skipping insertion in model container [2024-10-24 01:06:47,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:06:47" (2/3) ... [2024-10-24 01:06:47,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a381c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:06:47, skipping insertion in model container [2024-10-24 01:06:47,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:06:47" (3/3) ... [2024-10-24 01:06:47,336 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i5_o5-1.c [2024-10-24 01:06:47,354 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:06:47,355 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:06:47,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:06:47,433 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;@5d807baa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:06:47,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:06:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 01:06:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 01:06:47,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:06:47,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:06:47,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:06:47,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:06:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2024-10-24 01:06:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:06:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078936055] [2024-10-24 01:06:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:06:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:06:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:47,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:06:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:06:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:06:47,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078936055] [2024-10-24 01:06:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078936055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:06:47,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:06:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:06:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120004792] [2024-10-24 01:06:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:06:47,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:06:47,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:06:47,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:06:47,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:06:47,794 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:06:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:06:47,842 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-10-24 01:06:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:06:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-24 01:06:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:06:47,852 INFO L225 Difference]: With dead ends: 22 [2024-10-24 01:06:47,852 INFO L226 Difference]: Without dead ends: 14 [2024-10-24 01:06:47,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:06:47,858 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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-10-24 01:06:47,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:06:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-24 01:06:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-24 01:06:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 01:06:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-24 01:06:47,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-10-24 01:06:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:06:47,890 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-24 01:06:47,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:06:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-24 01:06:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 01:06:47,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:06:47,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:06:47,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:06:47,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:06:47,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:06:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2024-10-24 01:06:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:06:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459014905] [2024-10-24 01:06:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:06:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:06:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:48,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:06:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:48,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 01:06:48,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:06:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459014905] [2024-10-24 01:06:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459014905] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:06:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95254228] [2024-10-24 01:06:48,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:06:48,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:06:48,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:06:48,191 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 01:06:48,195 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 01:06:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:48,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 01:06:48,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:06:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 01:06:48,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:06:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 01:06:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95254228] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:06:48,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:06:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-10-24 01:06:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585196418] [2024-10-24 01:06:48,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:06:48,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:06:48,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:06:48,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:06:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:06:48,600 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 01:06:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:06:48,658 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-24 01:06:48,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:06:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 15 [2024-10-24 01:06:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:06:48,663 INFO L225 Difference]: With dead ends: 21 [2024-10-24 01:06:48,663 INFO L226 Difference]: Without dead ends: 17 [2024-10-24 01:06:48,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:06:48,665 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:06:48,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:06:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-24 01:06:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-24 01:06:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 01:06:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-24 01:06:48,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-10-24 01:06:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:06:48,676 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-24 01:06:48,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 01:06:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-10-24 01:06:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 01:06:48,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:06:48,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:06:48,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:06:48,882 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 01:06:48,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:06:48,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:06:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2024-10-24 01:06:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:06:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320302529] [2024-10-24 01:06:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:06:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:06:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:06:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:49,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 01:06:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:06:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320302529] [2024-10-24 01:06:49,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320302529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:06:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687067554] [2024-10-24 01:06:49,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 01:06:49,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:06:49,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:06:49,139 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 01:06:49,140 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 01:06:49,187 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 01:06:49,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:06:49,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 01:06:49,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:06:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 01:06:49,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:06:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 01:06:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687067554] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:06:49,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:06:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 14 [2024-10-24 01:06:49,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328914556] [2024-10-24 01:06:49,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:06:49,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 01:06:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:06:49,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 01:06:49,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:06:49,639 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 01:06:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:06:49,715 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-24 01:06:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:06:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 21 [2024-10-24 01:06:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:06:49,717 INFO L225 Difference]: With dead ends: 24 [2024-10-24 01:06:49,717 INFO L226 Difference]: Without dead ends: 20 [2024-10-24 01:06:49,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:06:49,718 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:06:49,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 40 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:06:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-24 01:06:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-24 01:06:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:06:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-24 01:06:49,727 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2024-10-24 01:06:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:06:49,728 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-24 01:06:49,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 01:06:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-24 01:06:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 01:06:49,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:06:49,730 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:06:49,746 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 01:06:49,931 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,SelfDestructingSolverStorable2 [2024-10-24 01:06:49,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:06:49,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:06:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2024-10-24 01:06:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:06:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342820927] [2024-10-24 01:06:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:06:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:06:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:49,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:06:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:06:50,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:06:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342820927] [2024-10-24 01:06:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342820927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:06:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206458325] [2024-10-24 01:06:50,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 01:06:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:06:50,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:06:50,144 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 01:06:50,146 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 01:06:50,188 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-24 01:06:50,188 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:06:50,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 01:06:50,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:06:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 01:06:50,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:06:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:06:50,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206458325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:06:50,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:06:50,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 16 [2024-10-24 01:06:50,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22534926] [2024-10-24 01:06:50,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:06:50,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 01:06:50,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:06:50,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 01:06:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:06:50,795 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 01:06:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:06:50,877 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-24 01:06:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:06:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 27 [2024-10-24 01:06:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:06:50,880 INFO L225 Difference]: With dead ends: 27 [2024-10-24 01:06:50,880 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 01:06:50,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-10-24 01:06:50,882 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:06:50,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 41 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:06:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 01:06:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 01:06:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 01:06:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-24 01:06:50,892 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2024-10-24 01:06:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:06:50,893 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-24 01:06:50,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 01:06:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-24 01:06:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 01:06:50,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:06:50,894 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:06:50,914 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 01:06:51,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:06:51,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:06:51,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:06:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2024-10-24 01:06:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:06:51,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98133324] [2024-10-24 01:06:51,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:06:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:06:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:51,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:06:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:06:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:06:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 01:06:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:06:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98133324] [2024-10-24 01:06:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98133324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:06:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167860126] [2024-10-24 01:06:51,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 01:06:51,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:06:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:06:51,360 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 01:06:51,361 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 01:06:51,414 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 01:06:51,414 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 01:06:51,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 01:06:51,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:06:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 01:06:51,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:06:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:06:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167860126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:06:52,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:06:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 17 [2024-10-24 01:06:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567743420] [2024-10-24 01:06:52,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:06:52,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 01:06:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:06:52,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 01:06:52,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:06:52,250 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 01:06:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:06:52,326 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-24 01:06:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:06:52,327 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 33 [2024-10-24 01:06:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:06:52,327 INFO L225 Difference]: With dead ends: 30 [2024-10-24 01:06:52,327 INFO L226 Difference]: Without dead ends: 26 [2024-10-24 01:06:52,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:06:52,329 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:06:52,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 49 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:06:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-24 01:06:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-24 01:06:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:06:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-24 01:06:52,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2024-10-24 01:06:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:06:52,340 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-24 01:06:52,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-24 01:06:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-24 01:06:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 01:06:52,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:06:52,341 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:06:52,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 01:06:52,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:06:52,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:06:52,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:06:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2024-10-24 01:06:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:06:52,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890206972] [2024-10-24 01:06:52,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:06:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:06:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:06:52,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 01:06:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:06:52,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 01:06:52,581 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 01:06:52,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 01:06:52,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:06:52,587 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1] [2024-10-24 01:06:52,609 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 01:06:52,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:06:52 BoogieIcfgContainer [2024-10-24 01:06:52,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 01:06:52,612 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 01:06:52,612 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 01:06:52,612 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 01:06:52,613 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:06:47" (3/4) ... [2024-10-24 01:06:52,614 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 01:06:52,654 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 01:06:52,654 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 01:06:52,655 INFO L158 Benchmark]: Toolchain (without parser) took 5845.32ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 134.5MB in the beginning and 83.0MB in the end (delta: 51.5MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2024-10-24 01:06:52,655 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:06:52,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.23ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 122.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 01:06:52,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.51ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 121.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 01:06:52,658 INFO L158 Benchmark]: Boogie Preprocessor took 23.08ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 01:06:52,659 INFO L158 Benchmark]: RCFGBuilder took 236.99ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 109.9MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 01:06:52,659 INFO L158 Benchmark]: TraceAbstraction took 5284.38ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 109.3MB in the beginning and 85.1MB in the end (delta: 24.2MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-10-24 01:06:52,659 INFO L158 Benchmark]: Witness Printer took 41.92ms. Allocated memory is still 203.4MB. Free memory was 85.1MB in the beginning and 83.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 01:06:52,661 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.18ms. Allocated memory is still 167.8MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.23ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 122.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.51ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 121.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.08ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 236.99ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 109.9MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5284.38ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 109.3MB in the beginning and 85.1MB in the end (delta: 24.2MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 41.92ms. Allocated memory is still 203.4MB. Free memory was 85.1MB in the beginning and 83.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 5; VAL [input=5] [L13] CALL, EXPR id(input) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=5] [L13] int result = id(input); [L14] COND TRUE result == 5 VAL [input=5] [L15] reach_error() VAL [input=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 47 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 172 SyntacticMatches, 15 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=5, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 10 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 110/300 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-24 01:06:52,689 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE