./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:13:57,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:13:57,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:13:57,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:13:57,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:13:57,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:13:57,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:13:57,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:13:57,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:13:57,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:13:57,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:13:57,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:13:57,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:13:57,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:13:57,930 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:13:57,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:13:57,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:13:57,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:13:57,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:13:57,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:13:57,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:13:57,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:13:57,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:13:57,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:13:57,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:13:57,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:13:57,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:13:57,935 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:13:57,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:13:57,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:13:57,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:13:57,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:13:57,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:13:57,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:13:57,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:13:57,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:13:57,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:13:57,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:13:57,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:13:57,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:13:57,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:13:57,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:13:57,942 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 -> 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 [2024-11-19 21:13:58,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:13:58,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:13:58,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:13:58,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:13:58,214 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:13:58,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-11-19 21:13:59,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:13:59,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:13:59,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-11-19 21:13:59,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f963a8e1/19f49b740990460c8207cbd7d05afb9e/FLAGb4e193692 [2024-11-19 21:13:59,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f963a8e1/19f49b740990460c8207cbd7d05afb9e [2024-11-19 21:13:59,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:13:59,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:13:59,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:13:59,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:13:59,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:13:59,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:13:59" (1/1) ... [2024-11-19 21:13:59,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466d7f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:13:59, skipping insertion in model container [2024-11-19 21:13:59,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:13:59" (1/1) ... [2024-11-19 21:13:59,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:14:00,083 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/nla-digbench-scaling/divbin_unwindbound5.i[950,963] [2024-11-19 21:14:00,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:14:00,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:14:00,137 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/nla-digbench-scaling/divbin_unwindbound5.i[950,963] [2024-11-19 21:14:00,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:14:00,165 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:14:00,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00 WrapperNode [2024-11-19 21:14:00,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:14:00,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:14:00,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:14:00,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:14:00,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,201 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2024-11-19 21:14:00,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:14:00,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:14:00,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:14:00,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:14:00,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,230 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-19 21:14:00,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:14:00,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:14:00,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:14:00,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:14:00,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (1/1) ... [2024-11-19 21:14:00,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:14:00,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:14:00,286 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-19 21:14:00,291 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-19 21:14:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:14:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 21:14:00,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 21:14:00,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:14:00,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:14:00,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:14:00,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 21:14:00,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 21:14:00,385 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:14:00,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:14:00,543 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-19 21:14:00,543 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:14:00,553 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:14:00,554 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 21:14:00,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:14:00 BoogieIcfgContainer [2024-11-19 21:14:00,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:14:00,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:14:00,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:14:00,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:14:00,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:13:59" (1/3) ... [2024-11-19 21:14:00,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532ad611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:14:00, skipping insertion in model container [2024-11-19 21:14:00,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:00" (2/3) ... [2024-11-19 21:14:00,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532ad611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:14:00, skipping insertion in model container [2024-11-19 21:14:00,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:14:00" (3/3) ... [2024-11-19 21:14:00,563 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2024-11-19 21:14:00,576 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:14:00,576 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:14:00,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:14:00,645 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;@2f478c70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:14:00,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:14:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 21:14:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 21:14:00,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:00,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:00,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:00,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1267887399, now seen corresponding path program 1 times [2024-11-19 21:14:00,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461282777] [2024-11-19 21:14:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:14:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:14:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:14:00,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:00,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461282777] [2024-11-19 21:14:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461282777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:14:00,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:14:00,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 21:14:00,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492199224] [2024-11-19 21:14:00,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:14:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:14:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:00,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:14:00,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 21:14:00,920 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 21:14:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:00,943 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2024-11-19 21:14:00,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:14:00,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-19 21:14:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:00,952 INFO L225 Difference]: With dead ends: 53 [2024-11-19 21:14:00,953 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 21:14:00,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 21:14:00,959 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:00,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:14:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 21:14:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 21:14:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 21:14:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-11-19 21:14:01,004 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2024-11-19 21:14:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:01,005 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-19 21:14:01,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 21:14:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-11-19 21:14:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 21:14:01,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:01,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:01,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:14:01,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:01,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1485611193, now seen corresponding path program 1 times [2024-11-19 21:14:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:01,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726990165] [2024-11-19 21:14:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:01,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:14:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:01,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:14:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:14:01,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726990165] [2024-11-19 21:14:01,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726990165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:14:01,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:14:01,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 21:14:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590247948] [2024-11-19 21:14:01,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:14:01,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:14:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:14:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:14:01,166 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:14:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:01,188 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-11-19 21:14:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:14:01,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-19 21:14:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:01,189 INFO L225 Difference]: With dead ends: 38 [2024-11-19 21:14:01,190 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 21:14:01,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:14:01,191 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:01,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:14:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 21:14:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 21:14:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 21:14:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-19 21:14:01,199 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 21 [2024-11-19 21:14:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:01,200 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-19 21:14:01,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:14:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-19 21:14:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 21:14:01,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:01,201 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:01,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:14:01,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:01,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1580975129, now seen corresponding path program 1 times [2024-11-19 21:14:01,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:01,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129835486] [2024-11-19 21:14:01,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:01,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:14:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953937429] [2024-11-19 21:14:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:14:01,272 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-19 21:14:01,274 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-19 21:14:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:01,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 21:14:01,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:14:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:14:01,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:14:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129835486] [2024-11-19 21:14:01,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:14:01,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953937429] [2024-11-19 21:14:01,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953937429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:14:01,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:14:01,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:14:01,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330751517] [2024-11-19 21:14:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:14:01,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:14:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:01,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:14:01,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:14:01,499 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:14:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:01,569 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-11-19 21:14:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:14:01,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 21:14:01,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:01,571 INFO L225 Difference]: With dead ends: 38 [2024-11-19 21:14:01,571 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 21:14:01,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:14:01,573 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:01,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 82 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:14:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 21:14:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 21:14:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 21:14:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-19 21:14:01,585 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 22 [2024-11-19 21:14:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:01,586 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-19 21:14:01,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:14:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-19 21:14:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 21:14:01,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:01,589 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:01,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 21:14:01,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:01,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:01,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:01,795 INFO L85 PathProgramCache]: Analyzing trace with hash -791365823, now seen corresponding path program 1 times [2024-11-19 21:14:01,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:01,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135458470] [2024-11-19 21:14:01,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:01,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:14:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:14:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:14:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:14:02,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:02,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135458470] [2024-11-19 21:14:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135458470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:14:02,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:14:02,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 21:14:02,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072359932] [2024-11-19 21:14:02,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:14:02,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:14:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:02,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:14:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 21:14:02,252 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:14:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:02,280 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-11-19 21:14:02,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:14:02,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-19 21:14:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:02,282 INFO L225 Difference]: With dead ends: 61 [2024-11-19 21:14:02,282 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 21:14:02,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 21:14:02,284 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:02,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:14:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 21:14:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 21:14:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 21:14:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-19 21:14:02,296 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 31 [2024-11-19 21:14:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:02,297 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-19 21:14:02,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:14:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-19 21:14:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 21:14:02,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:02,299 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:02,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 21:14:02,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:02,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:02,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2073553820, now seen corresponding path program 1 times [2024-11-19 21:14:02,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:02,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644858237] [2024-11-19 21:14:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:14:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:14:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:14:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 21:14:02,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:02,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644858237] [2024-11-19 21:14:02,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644858237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:14:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680144289] [2024-11-19 21:14:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:02,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:02,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:14:02,403 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-19 21:14:02,405 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-19 21:14:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 21:14:02,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:14:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 21:14:02,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:14:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 21:14:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680144289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:14:02,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:14:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-19 21:14:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114335956] [2024-11-19 21:14:02,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:14:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:14:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:02,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:14:02,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:14:02,572 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:14:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:02,656 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2024-11-19 21:14:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:14:02,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2024-11-19 21:14:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:02,660 INFO L225 Difference]: With dead ends: 76 [2024-11-19 21:14:02,660 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 21:14:02,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:14:02,661 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:02,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 96 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:14:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 21:14:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2024-11-19 21:14:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 21:14:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-19 21:14:02,673 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2024-11-19 21:14:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:02,673 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-19 21:14:02,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:14:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-19 21:14:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 21:14:02,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:02,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:02,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:14:02,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:02,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:02,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash 675416052, now seen corresponding path program 1 times [2024-11-19 21:14:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:02,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355938698] [2024-11-19 21:14:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:14:02,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960738300] [2024-11-19 21:14:02,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:02,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:14:02,923 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-19 21:14:02,924 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-19 21:14:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:02,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 21:14:02,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:14:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:14:03,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:14:12,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355938698] [2024-11-19 21:14:12,318 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:14:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960738300] [2024-11-19 21:14:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960738300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:14:12,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:14:12,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-19 21:14:12,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318608962] [2024-11-19 21:14:12,319 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 21:14:12,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:14:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:12,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:14:12,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2024-11-19 21:14:12,321 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:14:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:12,454 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-19 21:14:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:14:12,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-19 21:14:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:12,456 INFO L225 Difference]: With dead ends: 55 [2024-11-19 21:14:12,456 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 21:14:12,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=40, Invalid=169, Unknown=1, NotChecked=0, Total=210 [2024-11-19 21:14:12,457 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:12,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 136 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:14:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 21:14:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-19 21:14:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 21:14:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2024-11-19 21:14:12,465 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 34 [2024-11-19 21:14:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:12,465 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-11-19 21:14:12,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:14:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-11-19 21:14:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 21:14:12,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:12,466 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:12,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 21:14:12,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:12,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash 886516180, now seen corresponding path program 2 times [2024-11-19 21:14:12,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:12,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522725812] [2024-11-19 21:14:12,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:13,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:14:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:14:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 21:14:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:14:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:14:13,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522725812] [2024-11-19 21:14:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522725812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:14:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560736440] [2024-11-19 21:14:13,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 21:14:13,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:13,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:14:13,116 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-19 21:14:13,120 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-19 21:14:13,214 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 21:14:13,215 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:14:13,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 21:14:13,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:14:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 21:14:13,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:14:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 21:14:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560736440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:14:17,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:14:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 15] total 30 [2024-11-19 21:14:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712619008] [2024-11-19 21:14:17,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:14:17,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 21:14:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 21:14:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2024-11-19 21:14:17,494 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 10 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 21:14:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:18,723 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2024-11-19 21:14:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:14:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 10 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 43 [2024-11-19 21:14:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:18,725 INFO L225 Difference]: With dead ends: 108 [2024-11-19 21:14:18,725 INFO L226 Difference]: Without dead ends: 62 [2024-11-19 21:14:18,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2024-11-19 21:14:18,726 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:18,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 295 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:14:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-19 21:14:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2024-11-19 21:14:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 21:14:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-19 21:14:18,741 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2024-11-19 21:14:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:18,742 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-19 21:14:18,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 10 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 21:14:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-19 21:14:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 21:14:18,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:18,743 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:18,750 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-19 21:14:18,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:18,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:18,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2006317561, now seen corresponding path program 3 times [2024-11-19 21:14:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499513136] [2024-11-19 21:14:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:14:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:14:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:14:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:14:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:14:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499513136] [2024-11-19 21:14:19,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499513136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:14:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955272333] [2024-11-19 21:14:19,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 21:14:19,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:14:19,096 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-19 21:14:19,097 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-19 21:14:19,166 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 21:14:19,167 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:14:19,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 21:14:19,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:14:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:14:19,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:14:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:14:19,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955272333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:14:19,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:14:19,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 9 [2024-11-19 21:14:19,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63740641] [2024-11-19 21:14:19,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:14:19,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:14:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:19,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:14:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:14:19,312 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:14:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:19,367 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2024-11-19 21:14:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:14:19,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 46 [2024-11-19 21:14:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:19,370 INFO L225 Difference]: With dead ends: 94 [2024-11-19 21:14:19,370 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 21:14:19,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:14:19,371 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:19,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:14:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 21:14:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-19 21:14:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 21:14:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2024-11-19 21:14:19,382 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 46 [2024-11-19 21:14:19,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:19,383 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2024-11-19 21:14:19,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:14:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2024-11-19 21:14:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 21:14:19,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:14:19,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:19,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 21:14:19,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:19,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:14:19,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:14:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2008105021, now seen corresponding path program 1 times [2024-11-19 21:14:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:14:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637764702] [2024-11-19 21:14:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:14:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:14:19,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687390613] [2024-11-19 21:14:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:14:19,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:19,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:14:19,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:14:19,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 21:14:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:14:20,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 21:14:20,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:14:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:14:21,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:14:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:14:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:14:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637764702] [2024-11-19 21:14:27,577 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:14:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687390613] [2024-11-19 21:14:27,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687390613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:14:27,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:14:27,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-19 21:14:27,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930545165] [2024-11-19 21:14:27,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:14:27,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 21:14:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:14:27,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 21:14:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-11-19 21:14:27,579 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 21 states have internal predecessors, (56), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 21:14:33,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-19 21:14:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:14:34,977 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-19 21:14:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:14:34,978 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 21 states have internal predecessors, (56), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 46 [2024-11-19 21:14:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:14:34,978 INFO L225 Difference]: With dead ends: 46 [2024-11-19 21:14:34,979 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 21:14:34,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-11-19 21:14:34,980 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:14:34,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 326 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 226 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2024-11-19 21:14:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 21:14:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 21:14:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 21:14:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 21:14:34,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-11-19 21:14:34,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:14:34,983 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 21:14:34,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 21 states have internal predecessors, (56), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-19 21:14:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 21:14:34,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 21:14:34,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 21:14:34,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 21:14:35,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:14:35,191 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-11-19 21:14:35,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 21:14:49,943 WARN L286 SmtUtils]: Spent 11.09s on a formula simplification. DAG size of input: 119 DAG size of output: 113 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-19 21:14:49,947 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 21:14:49,971 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 21:14:49,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:14:49 BoogieIcfgContainer [2024-11-19 21:14:49,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 21:14:49,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 21:14:49,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 21:14:49,998 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 21:14:49,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:14:00" (3/4) ... [2024-11-19 21:14:50,000 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 21:14:50,003 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-19 21:14:50,003 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-19 21:14:50,007 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 21:14:50,007 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 21:14:50,007 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 21:14:50,008 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 21:14:50,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 21:14:50,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 21:14:50,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 21:14:50,092 INFO L158 Benchmark]: Toolchain (without parser) took 50205.06ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 95.1MB in the beginning and 150.9MB in the end (delta: -55.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 21:14:50,092 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 21:14:50,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.10ms. Allocated memory is still 148.9MB. Free memory was 94.7MB in the beginning and 81.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 21:14:50,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.29ms. Allocated memory is still 148.9MB. Free memory was 81.0MB in the beginning and 79.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 21:14:50,093 INFO L158 Benchmark]: Boogie Preprocessor took 45.27ms. Allocated memory is still 148.9MB. Free memory was 79.5MB in the beginning and 77.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 21:14:50,093 INFO L158 Benchmark]: RCFGBuilder took 306.58ms. Allocated memory is still 148.9MB. Free memory was 77.6MB in the beginning and 66.4MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 21:14:50,093 INFO L158 Benchmark]: TraceAbstraction took 49440.68ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 65.7MB in the beginning and 156.1MB in the end (delta: -90.4MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2024-11-19 21:14:50,094 INFO L158 Benchmark]: Witness Printer took 93.57ms. Allocated memory is still 203.4MB. Free memory was 156.1MB in the beginning and 150.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 21:14:50,095 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.17ms. Allocated memory is still 148.9MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.10ms. Allocated memory is still 148.9MB. Free memory was 94.7MB in the beginning and 81.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.29ms. Allocated memory is still 148.9MB. Free memory was 81.0MB in the beginning and 79.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.27ms. Allocated memory is still 148.9MB. Free memory was 79.5MB in the beginning and 77.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.58ms. Allocated memory is still 148.9MB. Free memory was 77.6MB in the beginning and 66.4MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49440.68ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 65.7MB in the beginning and 156.1MB in the end (delta: -90.4MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * Witness Printer took 93.57ms. Allocated memory is still 203.4MB. Free memory was 156.1MB in the beginning and 150.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.6s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 1211 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 956 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 729 IncrementalHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 255 mSDtfsCounter, 729 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 369 SyntacticMatches, 8 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=6, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 569 ConstructedInterpolants, 1 QuantifiedInterpolants, 3902 SizeOfPredicates, 18 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 221/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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((((((b == ((long long) 2 * B)) && (q == 0)) && (B <= 2147483646)) && (((long long) r + 1) <= b)) && (A == r)) || (((((((((((long long) b + r) % 4294967296) + 1) <= (4 * (B % 1073741824))) && (q == 1)) && (((long long) b + r) == A)) && (B <= 2147483646)) && ((2 * (B % 2147483648)) <= (((long long) b + r) % 4294967296))) && (4 <= counter)) && ((2 * (B % 1073741824)) == b))) || ((((((((((b == B) || (((r + ((long long) 6 * (b / 2))) % 4294967296) == A)) && (b <= 1073741823)) && (1 <= B)) && (3 == q)) && (B <= 2147483646)) && (((long long) A + 1) <= ((long long) b * 4))) && (((((((-1 + ((long long) -1 * b)) / 1073741824) - 1) * 2147483648) + ((long long) 2 * b)) + 2147483648) <= A)) && (A == (((long long) 3 * b) + r))) && (5 <= counter))) || (((((((long long) r + 1) <= (2 * (B % 2147483648))) && (q == 0)) && (B <= 2147483646)) && (b == (B % 2147483648))) && (A == r))) || ((((((((2 * (B % 2147483648)) <= r) && (q == 0)) && (B <= 2147483646)) && (((long long) r + 1) <= b)) && (A == r)) && (b == ((long long) B * 4))) && (3 <= counter))) || (((((((((b <= 1073741823) && (1 <= B)) && ((b == B) || (r < b))) && ((((((long long) 2 * b) + r) % 4294967296) + 1) <= ((long long) b * 4))) && ((b == B) || (((((long long) (b / 2) * 4) + r) % 4294967296) == A))) && (A == (((long long) 2 * b) + r))) && (2 == q)) && (B <= 2147483646)) && (5 <= counter))) || (((((1 <= B) && (q == 0)) && (B <= 2147483646)) && (A == r)) && (4 <= counter))) || (((((1 <= B) && (q == 1)) && (((long long) b + r) == A)) && (B <= 2147483646)) && (5 <= counter))) || ((((((q == 1) && (((long long) b + r) == A)) && (B <= 2147483646)) && (b == (B % 2147483648))) && (((long long) A + 1) <= (2 * (B % 2147483648)))) && (b <= A))) || ((((0 == 0) && (q == 0)) && (A == r)) && (b == B))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((B <= r) && (b == ((long long) 2 * B))) && (1 <= B)) && (q == 0)) && (B <= 2147483646)) && (A == r)) && (counter == 1)) || ((((((1 <= B) && (q == 0)) && (B == b)) && (B <= 2147483646)) && (counter == 0)) && (A == r))) || (((((1 <= B) && (q == 0)) && (B <= 2147483646)) && (A == r)) && (3 <= counter))) || (((((((2 <= counter) && ((2 * (B % 2147483648)) <= r)) && (1 <= B)) && (q == 0)) && (B <= 2147483646)) && (A == r)) && (b == ((long long) B * 4)))) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == 0)) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: ((1 <= cond) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-11-19 21:14:50,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE