./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/hard-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/hard-ll_valuebound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:59:31,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:59:31,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:59:31,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:59:31,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:59:31,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:59:31,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:59:31,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:59:31,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:59:31,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:59:31,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:59:31,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:59:31,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:59:31,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:59:31,435 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:59:31,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:59:31,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:59:31,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:59:31,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:59:31,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:59:31,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:59:31,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:59:31,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:59:31,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:59:31,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:59:31,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:59:31,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:59:31,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:59:31,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:59:31,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:59:31,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:59:31,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:59:31,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:59:31,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:59:31,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:59:31,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:59:31,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:59:31,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:59:31,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:59:31,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:59:31,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:59:31,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:59:31,446 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 -> 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 [2024-10-12 18:59:31,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:59:31,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:59:31,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:59:31,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:59:31,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:59:31,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2024-10-12 18:59:33,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:59:33,401 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:59:33,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2024-10-12 18:59:33,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a53fdf7/9586839397f54216a48f81752ec58bca/FLAG7abea095e [2024-10-12 18:59:33,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a53fdf7/9586839397f54216a48f81752ec58bca [2024-10-12 18:59:33,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:59:33,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:59:33,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:59:33,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:59:33,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:59:33,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33db10b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33, skipping insertion in model container [2024-10-12 18:59:33,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:59:33,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2024-10-12 18:59:33,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:59:33,666 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:59:33,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2024-10-12 18:59:33,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:59:33,697 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:59:33,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33 WrapperNode [2024-10-12 18:59:33,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:59:33,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:59:33,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:59:33,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:59:33,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,726 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-10-12 18:59:33,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:59:33,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:59:33,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:59:33,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:59:33,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 18:59:33,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:59:33,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:59:33,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:59:33,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:59:33,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (1/1) ... [2024-10-12 18:59:33,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:59:33,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:33,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:59:33,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:59:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:59:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 18:59:33,844 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 18:59:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:59:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:59:33,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:59:33,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:59:33,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:59:33,909 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:59:33,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:59:34,164 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-12 18:59:34,164 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:59:34,188 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:59:34,188 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 18:59:34,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:59:34 BoogieIcfgContainer [2024-10-12 18:59:34,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:59:34,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:59:34,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:59:34,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:59:34,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:59:33" (1/3) ... [2024-10-12 18:59:34,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57290d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:59:34, skipping insertion in model container [2024-10-12 18:59:34,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:59:33" (2/3) ... [2024-10-12 18:59:34,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57290d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:59:34, skipping insertion in model container [2024-10-12 18:59:34,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:59:34" (3/3) ... [2024-10-12 18:59:34,200 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2024-10-12 18:59:34,216 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:59:34,216 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:59:34,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:59:34,270 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;@50555fb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:59:34,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:59:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-12 18:59:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 18:59:34,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:34,281 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:34,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:34,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2024-10-12 18:59:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349789505] [2024-10-12 18:59:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:59:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:34,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:59:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 18:59:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:59:34,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:34,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349789505] [2024-10-12 18:59:34,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349789505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:59:34,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:59:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:59:34,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133757977] [2024-10-12 18:59:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:59:34,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:59:34,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:59:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:59:34,506 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:59:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:34,538 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2024-10-12 18:59:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:59:34,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-10-12 18:59:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:34,546 INFO L225 Difference]: With dead ends: 58 [2024-10-12 18:59:34,546 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:59:34,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:59:34,553 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:34,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:59:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:59:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 18:59:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 18:59:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-12 18:59:34,586 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2024-10-12 18:59:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:34,586 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-12 18:59:34,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:59:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-12 18:59:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 18:59:34,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:34,588 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:34,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:59:34,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:34,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:34,590 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2024-10-12 18:59:34,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:34,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861644146] [2024-10-12 18:59:34,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:34,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:59:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:59:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:34,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 18:59:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:59:34,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:34,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861644146] [2024-10-12 18:59:34,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861644146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:59:34,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:59:34,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:59:34,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324044824] [2024-10-12 18:59:34,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:59:34,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:59:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:34,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:59:34,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:59:34,854 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:59:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:34,925 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-10-12 18:59:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:59:34,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-12 18:59:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:34,928 INFO L225 Difference]: With dead ends: 41 [2024-10-12 18:59:34,928 INFO L226 Difference]: Without dead ends: 39 [2024-10-12 18:59:34,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:59:34,931 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:34,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:59:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-12 18:59:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-10-12 18:59:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 18:59:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-10-12 18:59:34,950 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2024-10-12 18:59:34,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:34,950 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-12 18:59:34,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:59:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-10-12 18:59:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:59:34,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:34,951 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:34,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:59:34,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:34,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2024-10-12 18:59:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:34,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892817657] [2024-10-12 18:59:34,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:34,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:59:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:59:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 18:59:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:35,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:59:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:59:35,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:35,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892817657] [2024-10-12 18:59:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892817657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:59:35,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:59:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:59:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928280489] [2024-10-12 18:59:35,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:59:35,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:59:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:35,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:59:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:59:35,136 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 18:59:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:35,225 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-10-12 18:59:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:59:35,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-12 18:59:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:35,229 INFO L225 Difference]: With dead ends: 45 [2024-10-12 18:59:35,229 INFO L226 Difference]: Without dead ends: 43 [2024-10-12 18:59:35,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:59:35,231 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:35,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:59:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-12 18:59:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-10-12 18:59:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 18:59:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-12 18:59:35,248 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2024-10-12 18:59:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:35,249 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-12 18:59:35,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 18:59:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-12 18:59:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 18:59:35,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:35,250 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:35,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:59:35,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:35,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2024-10-12 18:59:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:35,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427658216] [2024-10-12 18:59:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:59:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673977735] [2024-10-12 18:59:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:35,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:35,290 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:59:35,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:59:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:35,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:59:35,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:59:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 18:59:35,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:59:35,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427658216] [2024-10-12 18:59:35,483 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:59:35,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673977735] [2024-10-12 18:59:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673977735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:59:35,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:59:35,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:59:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592780] [2024-10-12 18:59:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:59:35,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:59:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:35,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:59:35,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:59:35,491 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 18:59:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:35,588 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-10-12 18:59:35,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:59:35,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-12 18:59:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:35,589 INFO L225 Difference]: With dead ends: 62 [2024-10-12 18:59:35,589 INFO L226 Difference]: Without dead ends: 49 [2024-10-12 18:59:35,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:59:35,591 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:35,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 117 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:59:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-12 18:59:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-12 18:59:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 18:59:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-10-12 18:59:35,605 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 33 [2024-10-12 18:59:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:35,606 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-10-12 18:59:35,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 18:59:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-10-12 18:59:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 18:59:35,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:35,610 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:35,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:59:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:35,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:35,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2024-10-12 18:59:35,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:35,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315214563] [2024-10-12 18:59:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:59:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137309339] [2024-10-12 18:59:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:35,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:35,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:35,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:59:35,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:59:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:35,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 18:59:35,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:59:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 18:59:36,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:59:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 18:59:36,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315214563] [2024-10-12 18:59:36,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:59:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137309339] [2024-10-12 18:59:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137309339] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:59:36,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:59:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-12 18:59:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031906067] [2024-10-12 18:59:36,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:59:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:59:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:59:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:59:36,273 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 18:59:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:36,450 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-10-12 18:59:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:59:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 40 [2024-10-12 18:59:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:36,455 INFO L225 Difference]: With dead ends: 64 [2024-10-12 18:59:36,455 INFO L226 Difference]: Without dead ends: 62 [2024-10-12 18:59:36,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:59:36,456 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:36,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 161 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:59:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-12 18:59:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-10-12 18:59:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 18:59:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-10-12 18:59:36,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 40 [2024-10-12 18:59:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:36,479 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-10-12 18:59:36,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 18:59:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-10-12 18:59:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 18:59:36,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:36,481 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:36,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:59:36,685 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-10-12 18:59:36,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:36,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:36,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2024-10-12 18:59:36,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:36,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475274647] [2024-10-12 18:59:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:59:36,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747297587] [2024-10-12 18:59:36,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:36,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:36,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:36,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:59:36,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:59:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:36,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 18:59:36,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:59:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-12 18:59:37,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:59:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 18:59:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475274647] [2024-10-12 18:59:37,141 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:59:37,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747297587] [2024-10-12 18:59:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747297587] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 18:59:37,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:59:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-12 18:59:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417013411] [2024-10-12 18:59:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:59:37,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:59:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:37,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:59:37,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:59:37,143 INFO L87 Difference]: Start difference. First operand 59 states and 76 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 18:59:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:37,216 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-10-12 18:59:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:59:37,217 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-10-12 18:59:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:37,218 INFO L225 Difference]: With dead ends: 69 [2024-10-12 18:59:37,218 INFO L226 Difference]: Without dead ends: 67 [2024-10-12 18:59:37,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:59:37,219 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:37,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 110 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:59:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-12 18:59:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-12 18:59:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 18:59:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-10-12 18:59:37,244 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 50 [2024-10-12 18:59:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:37,245 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-10-12 18:59:37,245 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 18:59:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-10-12 18:59:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 18:59:37,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:37,246 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:37,265 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-10-12 18:59:37,447 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-10-12 18:59:37,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:37,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 73871321, now seen corresponding path program 1 times [2024-10-12 18:59:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:37,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960501231] [2024-10-12 18:59:37,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:37,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:59:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:59:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 18:59:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:59:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:59:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:59:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 18:59:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 18:59:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 18:59:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-12 18:59:37,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:37,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960501231] [2024-10-12 18:59:37,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960501231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:59:37,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:59:37,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:59:37,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000085274] [2024-10-12 18:59:37,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:59:37,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:59:37,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:37,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:59:37,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:59:37,689 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 18:59:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:37,758 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2024-10-12 18:59:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:59:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2024-10-12 18:59:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:37,760 INFO L225 Difference]: With dead ends: 74 [2024-10-12 18:59:37,760 INFO L226 Difference]: Without dead ends: 62 [2024-10-12 18:59:37,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:59:37,761 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:37,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 127 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:59:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-12 18:59:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-12 18:59:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 18:59:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2024-10-12 18:59:37,772 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 56 [2024-10-12 18:59:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:37,773 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2024-10-12 18:59:37,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 18:59:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2024-10-12 18:59:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 18:59:37,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:37,774 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:37,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 18:59:37,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:37,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:37,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2024-10-12 18:59:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927874791] [2024-10-12 18:59:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:37,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:59:37,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685559597] [2024-10-12 18:59:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:37,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:37,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:37,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:59:37,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:59:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:37,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 18:59:37,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:59:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-12 18:59:38,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:59:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-12 18:59:40,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927874791] [2024-10-12 18:59:40,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:59:40,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685559597] [2024-10-12 18:59:40,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685559597] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:59:40,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:59:40,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-10-12 18:59:40,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771150098] [2024-10-12 18:59:40,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:59:40,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 18:59:40,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:40,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 18:59:40,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:59:40,430 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-12 18:59:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:40,894 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2024-10-12 18:59:40,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:59:40,895 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) Word has length 70 [2024-10-12 18:59:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:40,897 INFO L225 Difference]: With dead ends: 118 [2024-10-12 18:59:40,897 INFO L226 Difference]: Without dead ends: 95 [2024-10-12 18:59:40,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-10-12 18:59:40,898 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 55 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:40,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 223 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 18:59:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-12 18:59:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2024-10-12 18:59:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 18:59:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2024-10-12 18:59:40,925 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 70 [2024-10-12 18:59:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:40,926 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2024-10-12 18:59:40,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2024-10-12 18:59:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2024-10-12 18:59:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 18:59:40,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:40,929 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:40,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 18:59:41,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:41,130 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2024-10-12 18:59:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:41,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264260672] [2024-10-12 18:59:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:59:41,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400126888] [2024-10-12 18:59:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:41,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:41,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:41,185 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-10-12 18:59:41,187 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-10-12 18:59:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:41,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 18:59:41,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:59:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-12 18:59:41,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:59:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-12 18:59:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:42,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264260672] [2024-10-12 18:59:42,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:59:42,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400126888] [2024-10-12 18:59:42,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400126888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:59:42,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:59:42,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-10-12 18:59:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463683376] [2024-10-12 18:59:42,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:59:42,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 18:59:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:42,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 18:59:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:59:42,253 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 21 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2024-10-12 18:59:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:43,184 INFO L93 Difference]: Finished difference Result 129 states and 165 transitions. [2024-10-12 18:59:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 18:59:43,184 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) Word has length 81 [2024-10-12 18:59:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:43,186 INFO L225 Difference]: With dead ends: 129 [2024-10-12 18:59:43,186 INFO L226 Difference]: Without dead ends: 125 [2024-10-12 18:59:43,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 18:59:43,187 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 99 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:43,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 338 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 18:59:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-12 18:59:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2024-10-12 18:59:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-12 18:59:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2024-10-12 18:59:43,221 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 81 [2024-10-12 18:59:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:43,222 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2024-10-12 18:59:43,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2024-10-12 18:59:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2024-10-12 18:59:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 18:59:43,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:43,224 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:43,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:59:43,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:43,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1271237959, now seen corresponding path program 1 times [2024-10-12 18:59:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294009631] [2024-10-12 18:59:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:43,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:59:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:59:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 18:59:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:59:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:59:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:59:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 18:59:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 18:59:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 18:59:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 18:59:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 18:59:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 18:59:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 18:59:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 18:59:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 18:59:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-12 18:59:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294009631] [2024-10-12 18:59:43,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294009631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:59:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297343821] [2024-10-12 18:59:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:43,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:43,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:43,576 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-10-12 18:59:43,578 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-10-12 18:59:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:43,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:59:43,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:59:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-12 18:59:43,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:59:43,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297343821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:59:43,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:59:43,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-10-12 18:59:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50428537] [2024-10-12 18:59:43,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:59:43,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:59:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:59:43,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:59:43,677 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-12 18:59:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:43,748 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2024-10-12 18:59:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:59:43,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 90 [2024-10-12 18:59:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:43,750 INFO L225 Difference]: With dead ends: 128 [2024-10-12 18:59:43,751 INFO L226 Difference]: Without dead ends: 116 [2024-10-12 18:59:43,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:59:43,752 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:43,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:59:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-12 18:59:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-12 18:59:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 72 states have internal predecessors, (82), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-12 18:59:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2024-10-12 18:59:43,792 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 90 [2024-10-12 18:59:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:43,793 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2024-10-12 18:59:43,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-12 18:59:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2024-10-12 18:59:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 18:59:43,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:43,795 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 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, 1, 1, 1, 1, 1] [2024-10-12 18:59:43,813 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-10-12 18:59:43,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:43,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:43,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1929819069, now seen corresponding path program 2 times [2024-10-12 18:59:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844051553] [2024-10-12 18:59:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:59:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:59:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 18:59:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:59:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:59:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:59:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 18:59:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 18:59:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 18:59:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 18:59:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 18:59:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 18:59:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 18:59:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 18:59:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 18:59:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-12 18:59:44,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:44,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844051553] [2024-10-12 18:59:44,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844051553] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:59:44,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149990849] [2024-10-12 18:59:44,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:59:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:44,236 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:59:44,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 18:59:44,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:59:44,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:59:44,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:59:44,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:59:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 109 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-12 18:59:44,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:59:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-12 18:59:44,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149990849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:59:44,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:59:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-12 18:59:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541824298] [2024-10-12 18:59:44,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:59:44,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:59:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:59:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:59:44,437 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-12 18:59:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:44,500 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2024-10-12 18:59:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:59:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 94 [2024-10-12 18:59:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:44,502 INFO L225 Difference]: With dead ends: 142 [2024-10-12 18:59:44,502 INFO L226 Difference]: Without dead ends: 97 [2024-10-12 18:59:44,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:59:44,503 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:44,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:59:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-12 18:59:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-12 18:59:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 18:59:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2024-10-12 18:59:44,530 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 94 [2024-10-12 18:59:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:44,530 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-10-12 18:59:44,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-12 18:59:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2024-10-12 18:59:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 18:59:44,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:59:44,532 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:44,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 18:59:44,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:44,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:59:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:59:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 924515754, now seen corresponding path program 3 times [2024-10-12 18:59:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:59:44,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79776231] [2024-10-12 18:59:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:59:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:59:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:59:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:59:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 18:59:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:59:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:59:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:59:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 18:59:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 18:59:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 18:59:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 18:59:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 18:59:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 18:59:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 18:59:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 18:59:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 18:59:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 18:59:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 18:59:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 18:59:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:59:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 38 proven. 26 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-12 18:59:45,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:59:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79776231] [2024-10-12 18:59:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79776231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:59:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988836451] [2024-10-12 18:59:45,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 18:59:45,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:59:45,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:59:45,629 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:59:45,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 18:59:45,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 18:59:45,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:59:45,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 18:59:45,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:59:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 246 proven. 3 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-10-12 18:59:45,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:59:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-10-12 18:59:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988836451] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:59:46,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:59:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2024-10-12 18:59:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749019452] [2024-10-12 18:59:46,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:59:46,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 18:59:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:59:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 18:59:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:59:46,037 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 13 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (41), 14 states have call predecessors, (41), 13 states have call successors, (41) [2024-10-12 18:59:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:59:46,209 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2024-10-12 18:59:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:59:46,210 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 13 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (41), 14 states have call predecessors, (41), 13 states have call successors, (41) Word has length 111 [2024-10-12 18:59:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:59:46,211 INFO L225 Difference]: With dead ends: 101 [2024-10-12 18:59:46,211 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 18:59:46,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-10-12 18:59:46,212 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:59:46,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 230 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:59:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 18:59:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 18:59:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:59:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 18:59:46,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2024-10-12 18:59:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:59:46,216 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 18:59:46,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 13 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (41), 14 states have call predecessors, (41), 13 states have call successors, (41) [2024-10-12 18:59:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 18:59:46,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 18:59:46,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:59:46,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 18:59:46,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 18:59:46,424 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:59:46,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 18:59:46,921 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:59:46,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:59:46 BoogieIcfgContainer [2024-10-12 18:59:46,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:59:46,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:59:46,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:59:46,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:59:46,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:59:34" (3/4) ... [2024-10-12 18:59:46,952 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 18:59:46,955 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-12 18:59:46,955 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-12 18:59:46,959 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-12 18:59:46,959 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 18:59:46,960 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 18:59:46,960 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 18:59:47,048 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:59:47,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 18:59:47,051 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:59:47,051 INFO L158 Benchmark]: Toolchain (without parser) took 13626.68ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 149.7MB in the beginning and 188.3MB in the end (delta: -38.5MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-10-12 18:59:47,052 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:59:47,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.40ms. Allocated memory is still 180.4MB. Free memory was 149.5MB in the beginning and 142.8MB in the end (delta: 6.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-12 18:59:47,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.93ms. Allocated memory is still 180.4MB. Free memory was 142.8MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:59:47,052 INFO L158 Benchmark]: Boogie Preprocessor took 37.27ms. Allocated memory is still 180.4MB. Free memory was 140.8MB in the beginning and 138.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:59:47,052 INFO L158 Benchmark]: RCFGBuilder took 423.32ms. Allocated memory is still 180.4MB. Free memory was 138.7MB in the beginning and 145.3MB in the end (delta: -6.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 18:59:47,053 INFO L158 Benchmark]: TraceAbstraction took 12757.84ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 144.3MB in the beginning and 193.5MB in the end (delta: -49.3MB). Peak memory consumption was 151.0MB. Max. memory is 16.1GB. [2024-10-12 18:59:47,053 INFO L158 Benchmark]: Witness Printer took 102.12ms. Allocated memory is still 262.1MB. Free memory was 193.5MB in the beginning and 188.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 18:59:47,055 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.40ms. Allocated memory is still 180.4MB. Free memory was 149.5MB in the beginning and 142.8MB in the end (delta: 6.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.93ms. Allocated memory is still 180.4MB. Free memory was 142.8MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.27ms. Allocated memory is still 180.4MB. Free memory was 140.8MB in the beginning and 138.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.32ms. Allocated memory is still 180.4MB. Free memory was 138.7MB in the beginning and 145.3MB in the end (delta: -6.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12757.84ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 144.3MB in the beginning and 193.5MB in the end (delta: -49.3MB). Peak memory consumption was 151.0MB. Max. memory is 16.1GB. * Witness Printer took 102.12ms. Allocated memory is still 262.1MB. Free memory was 193.5MB in the beginning and 188.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 1881 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1471 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1092 IncrementalHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 410 mSDtfsCounter, 1092 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1203 GetRequests, 1083 SyntacticMatches, 4 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1268 NumberOfCodeBlocks, 1210 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1419 ConstructedInterpolants, 0 QuantifiedInterpolants, 6309 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1159 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 4000/4124 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: 46]: Loop Invariant Derived loop invariant: ((((((((2 == p) && (A == 1)) && (B == 1)) && (q == 0)) && (r == 1)) && (2 == d)) || ((((p == 1) && (d == B)) && (q == 0)) && (r == A))) || ((((((d == 1) && (p == 1)) && (A == 1)) && (B == 1)) && (r == 0)) && (q == 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((d == 1) && (p == 1)) && (B == 1)) && (((__int128) ((long long) 3 * B) + r) <= 4)) && (q == 0)) && (r == A)) || ((((((2 == p) && (B == 1)) && (q == 0)) && (r == 1)) && (r == A)) && (2 == d))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-12 18:59:47,085 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