./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_o1000.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_o1000.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 1ac5ce2c5b306e431b6746a0cb1bbdfcd1ec9c3d54097bd6037af4480ff2bd07 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:00:09,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:00:09,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:00:09,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:00:09,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:00:09,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:00:09,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:00:09,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:00:09,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:00:09,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:00:09,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:00:09,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:00:09,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:00:09,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:00:09,869 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:00:09,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:00:09,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:00:09,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:00:09,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:00:09,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:00:09,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:00:09,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:00:09,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:00:09,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:00:09,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:00:09,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:00:09,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:00:09,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:00:09,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:00:09,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:00:09,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:00:09,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:00:09,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:00:09,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:00:09,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:00:09,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:00:09,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:00:09,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:00:09,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:00:09,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:00:09,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:00:09,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:00:09,878 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 -> 1ac5ce2c5b306e431b6746a0cb1bbdfcd1ec9c3d54097bd6037af4480ff2bd07 [2024-11-11 21:00:10,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:00:10,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:00:10,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:00:10,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:00:10,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:00:10,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_o1000.c [2024-11-11 21:00:11,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:00:11,774 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:00:11,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o1000.c [2024-11-11 21:00:11,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b732394bd/d01c81c592d1412d946a0cb718975153/FLAG821bdb14c [2024-11-11 21:00:11,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b732394bd/d01c81c592d1412d946a0cb718975153 [2024-11-11 21:00:11,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:00:11,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:00:11,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:00:11,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:00:11,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:00:11,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:00:11" (1/1) ... [2024-11-11 21:00:11,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2813c01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:11, skipping insertion in model container [2024-11-11 21:00:11,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:00:11" (1/1) ... [2024-11-11 21:00:11,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:00:12,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o1000.c[520,533] [2024-11-11 21:00:12,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:00:12,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:00:12,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o1000.c[520,533] [2024-11-11 21:00:12,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:00:12,062 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:00:12,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12 WrapperNode [2024-11-11 21:00:12,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:00:12,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:00:12,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:00:12,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:00:12,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,091 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-11 21:00:12,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:00:12,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:00:12,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:00:12,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:00:12,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,115 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-11-11 21:00:12,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:00:12,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:00:12,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:00:12,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:00:12,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:00:12,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:12,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:00:12,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:00:12,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:00:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:00:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:00:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:00:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-11 21:00:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-11 21:00:12,256 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:00:12,258 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:00:12,353 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-11 21:00:12,353 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:00:12,363 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:00:12,363 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:00:12,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:00:12 BoogieIcfgContainer [2024-11-11 21:00:12,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:00:12,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:00:12,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:00:12,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:00:12,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:00:11" (1/3) ... [2024-11-11 21:00:12,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d0a367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:00:12, skipping insertion in model container [2024-11-11 21:00:12,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (2/3) ... [2024-11-11 21:00:12,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d0a367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:00:12, skipping insertion in model container [2024-11-11 21:00:12,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:00:12" (3/3) ... [2024-11-11 21:00:12,378 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o1000.c [2024-11-11 21:00:12,396 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:00:12,396 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:00:12,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:00:12,462 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;@42dd5782, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:00:12,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:00:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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-11-11 21:00:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 21:00:12,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:12,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:12,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-11 21:00:12,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681910607] [2024-11-11 21:00:12,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:12,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:00:12,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:12,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681910607] [2024-11-11 21:00:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681910607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:00:12,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:00:12,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:00:12,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577891344] [2024-11-11 21:00:12,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:00:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:00:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:12,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:00:12,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:00:12,803 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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.6) internal successors, (8), 4 states have internal predecessors, (8), 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-11-11 21:00:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:12,842 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-11 21:00:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:00:12,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-11-11 21:00:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:12,852 INFO L225 Difference]: With dead ends: 25 [2024-11-11 21:00:12,852 INFO L226 Difference]: Without dead ends: 15 [2024-11-11 21:00:12,855 INFO L434 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-11-11 21:00:12,859 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:12,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-11 21:00:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-11 21:00:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 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-11-11 21:00:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-11 21:00:12,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-11 21:00:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:12,897 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-11 21:00:12,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-11-11 21:00:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-11 21:00:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 21:00:12,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:12,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:12,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:00:12,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:12,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-11 21:00:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417829403] [2024-11-11 21:00:12,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:00:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417829403] [2024-11-11 21:00:13,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417829403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:13,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957812290] [2024-11-11 21:00:13,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:13,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:13,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:13,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:00:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 21:00:13,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:00:13,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:00:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957812290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:13,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:13,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-11 21:00:13,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262510725] [2024-11-11 21:00:13,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:13,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:00:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:13,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:00:13,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:00:13,541 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:00:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:13,596 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-11 21:00:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:00:13,597 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 16 [2024-11-11 21:00:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:13,598 INFO L225 Difference]: With dead ends: 27 [2024-11-11 21:00:13,598 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 21:00:13,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:00:13,601 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:13,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 21:00:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 21:00:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 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-11-11 21:00:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-11 21:00:13,611 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-11-11 21:00:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:13,612 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-11 21:00:13,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:00:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-11 21:00:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 21:00:13,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:13,614 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:13,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:00:13,818 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-11-11 21:00:13,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:13,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 2 times [2024-11-11 21:00:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:13,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966184093] [2024-11-11 21:00:13,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:13,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966184093] [2024-11-11 21:00:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966184093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783015687] [2024-11-11 21:00:14,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:00:14,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:14,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:14,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:14,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:00:14,308 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 21:00:14,308 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:14,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:00:14,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:14,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:14,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783015687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:14,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-11 21:00:14,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971850428] [2024-11-11 21:00:14,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:14,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:00:14,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:00:14,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:00:14,691 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 21:00:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:14,885 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-11 21:00:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:00:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 28 [2024-11-11 21:00:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:14,887 INFO L225 Difference]: With dead ends: 39 [2024-11-11 21:00:14,887 INFO L226 Difference]: Without dead ends: 33 [2024-11-11 21:00:14,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:00:14,888 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:14,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-11 21:00:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-11 21:00:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 21:00:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-11 21:00:14,902 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2024-11-11 21:00:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:14,902 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-11 21:00:14,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 21:00:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-11 21:00:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:00:14,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:14,905 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:14,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:15,105 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-11-11 21:00:15,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:15,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:15,107 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 3 times [2024-11-11 21:00:15,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:15,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033748455] [2024-11-11 21:00:15,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033748455] [2024-11-11 21:00:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033748455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200363118] [2024-11-11 21:00:15,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 21:00:15,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:15,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:15,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:15,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:00:15,926 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-11 21:00:15,926 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:15,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-11 21:00:15,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:16,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:16,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200363118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:16,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:16,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2024-11-11 21:00:16,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069734824] [2024-11-11 21:00:16,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:16,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-11 21:00:16,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:16,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-11 21:00:16,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:00:16,913 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-11 21:00:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:17,959 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-11-11 21:00:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-11 21:00:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 52 [2024-11-11 21:00:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:17,963 INFO L225 Difference]: With dead ends: 63 [2024-11-11 21:00:17,963 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 21:00:17,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352 [2024-11-11 21:00:17,967 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:17,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:00:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 21:00:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-11 21:00:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 21:00:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-11 21:00:17,989 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2024-11-11 21:00:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:17,990 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-11 21:00:17,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-11 21:00:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-11 21:00:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:00:17,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:17,995 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:18,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:00:18,199 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-11-11 21:00:18,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:18,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 4 times [2024-11-11 21:00:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982469733] [2024-11-11 21:00:18,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-11 21:00:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:20,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982469733] [2024-11-11 21:00:20,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982469733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:20,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347878208] [2024-11-11 21:00:20,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 21:00:20,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:20,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:20,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:00:20,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:00:20,317 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 21:00:20,317 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:20,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-11 21:00:20,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-11 21:00:20,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-11 21:00:23,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347878208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:23,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:23,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2024-11-11 21:00:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018133096] [2024-11-11 21:00:23,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:23,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-11-11 21:00:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:23,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-11-11 21:00:23,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=4072, Unknown=0, NotChecked=0, Total=4692 [2024-11-11 21:00:23,026 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-11 21:00:28,930 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-11 21:00:43,566 WARN L286 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-11 21:00:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:53,897 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2024-11-11 21:00:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-11 21:00:53,900 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) Word has length 100 [2024-11-11 21:00:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:53,902 INFO L225 Difference]: With dead ends: 111 [2024-11-11 21:00:53,902 INFO L226 Difference]: Without dead ends: 105 [2024-11-11 21:00:53,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=1530, Invalid=7782, Unknown=0, NotChecked=0, Total=9312 [2024-11-11 21:00:53,908 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:53,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1284 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:00:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-11 21:00:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-11 21:00:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 71 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (33), 32 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-11 21:00:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2024-11-11 21:00:53,926 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2024-11-11 21:00:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:53,927 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2024-11-11 21:00:53,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-11 21:00:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2024-11-11 21:00:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-11 21:00:53,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:53,931 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:53,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:00:54,134 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-11-11 21:00:54,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:54,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1665704854, now seen corresponding path program 5 times [2024-11-11 21:00:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:54,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498600396] [2024-11-11 21:00:54,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:54,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:54,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:56,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:57,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:58,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:59,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:59,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:59,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:01:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:01:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2024-11-11 21:01:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:01:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498600396] [2024-11-11 21:01:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498600396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:01:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149114216] [2024-11-11 21:01:02,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 21:01:02,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:01:02,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:01:02,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:01:02,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 21:01:03,118 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-11-11 21:01:03,118 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:01:03,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-11 21:01:03,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:01:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2024-11-11 21:01:03,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:01:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2024-11-11 21:01:11,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149114216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:01:11,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:01:11,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2024-11-11 21:01:11,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311810202] [2024-11-11 21:01:11,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:01:11,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2024-11-11 21:01:11,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:01:11,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2024-11-11 21:01:11,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2252, Invalid=15304, Unknown=0, NotChecked=0, Total=17556 [2024-11-11 21:01:11,743 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 133 states, 133 states have (on average 1.0451127819548873) internal successors, (139), 69 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 64 states have return successors, (64), 64 states have call predecessors, (64), 1 states have call successors, (64)