./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.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 a340dc1e9a375ad2082e9c8cecf3a1a681edcfe0f7220085504fa1991ced3d70 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:58:22,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:58:22,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:58:22,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:58:22,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:58:22,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:58:22,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:58:22,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:58:22,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:58:22,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:58:22,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:58:22,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:58:22,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:58:22,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:58:22,738 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:58:22,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:58:22,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:58:22,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:58:22,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:58:22,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:58:22,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:58:22,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:58:22,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:58:22,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:58:22,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:58:22,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:58:22,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:58:22,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:58:22,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:58:22,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:58:22,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:58:22,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:58:22,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:58:22,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:58:22,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:58:22,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:58:22,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:58:22,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:58:22,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:58:22,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:58:22,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:58:22,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:58:22,748 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 -> a340dc1e9a375ad2082e9c8cecf3a1a681edcfe0f7220085504fa1991ced3d70 [2024-11-11 19:58:22,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:58:23,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:58:23,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:58:23,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:58:23,023 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:58:23,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2024-11-11 19:58:24,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:58:24,676 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:58:24,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2024-11-11 19:58:24,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a485b1415/25205d67fd7247a9a4bb8e7a547f2e06/FLAGd28985774 [2024-11-11 19:58:24,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a485b1415/25205d67fd7247a9a4bb8e7a547f2e06 [2024-11-11 19:58:24,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:58:24,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:58:24,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:58:24,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:58:24,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:58:24,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:24,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece5df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24, skipping insertion in model container [2024-11-11 19:58:24,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:24,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:58:24,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c[576,589] [2024-11-11 19:58:24,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:58:24,948 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:58:24,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c[576,589] [2024-11-11 19:58:24,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:58:24,981 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:58:24,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24 WrapperNode [2024-11-11 19:58:24,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:58:24,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:58:24,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:58:24,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:58:24,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:24,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,013 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-11 19:58:25,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:58:25,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:58:25,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:58:25,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:58:25,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,035 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 19:58:25,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:58:25,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:58:25,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:58:25,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:58:25,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (1/1) ... [2024-11-11 19:58:25,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:58:25,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:25,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:58:25,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:58:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:58:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:58:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:58:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:58:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 19:58:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 19:58:25,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:58:25,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:58:25,386 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-11 19:58:25,387 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:58:25,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:58:25,402 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 19:58:25,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:58:25 BoogieIcfgContainer [2024-11-11 19:58:25,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:58:25,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:58:25,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:58:25,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:58:25,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:58:24" (1/3) ... [2024-11-11 19:58:25,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461ebb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:58:25, skipping insertion in model container [2024-11-11 19:58:25,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:58:24" (2/3) ... [2024-11-11 19:58:25,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461ebb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:58:25, skipping insertion in model container [2024-11-11 19:58:25,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:58:25" (3/3) ... [2024-11-11 19:58:25,415 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound10.c [2024-11-11 19:58:25,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:58:25,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:58:25,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:58:25,505 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;@71bc608e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:58:25,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:58:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 19:58:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 19:58:25,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:25,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:25,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:25,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:25,520 INFO L85 PathProgramCache]: Analyzing trace with hash -555122024, now seen corresponding path program 1 times [2024-11-11 19:58:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:25,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251146537] [2024-11-11 19:58:25,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:58:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251146537] [2024-11-11 19:58:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251146537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:25,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:58:25,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591543965] [2024-11-11 19:58:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:25,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:58:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:25,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:58:25,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:58:25,732 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:58:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:25,750 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2024-11-11 19:58:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:58:25,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-11 19:58:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:25,759 INFO L225 Difference]: With dead ends: 55 [2024-11-11 19:58:25,759 INFO L226 Difference]: Without dead ends: 25 [2024-11-11 19:58:25,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:58:25,767 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:25,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:58:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-11 19:58:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-11 19:58:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 19:58:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-11-11 19:58:25,811 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 9 [2024-11-11 19:58:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:25,812 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-11-11 19:58:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:58:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-11-11 19:58:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:58:25,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:25,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:25,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:58:25,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:25,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1985514477, now seen corresponding path program 1 times [2024-11-11 19:58:25,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:25,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731519302] [2024-11-11 19:58:25,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:58:25,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:25,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731519302] [2024-11-11 19:58:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731519302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:58:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102701136] [2024-11-11 19:58:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:25,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:58:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:25,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:58:25,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:58:25,961 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:58:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:25,998 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-11 19:58:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:58:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 19:58:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:26,001 INFO L225 Difference]: With dead ends: 34 [2024-11-11 19:58:26,002 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 19:58:26,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:58:26,003 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:26,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:58:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 19:58:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 19:58:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 19:58:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-11 19:58:26,018 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2024-11-11 19:58:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:26,019 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-11 19:58:26,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:58:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-11-11 19:58:26,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:58:26,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:26,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:26,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:58:26,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:26,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1984024927, now seen corresponding path program 1 times [2024-11-11 19:58:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47402063] [2024-11-11 19:58:26,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:26,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814922307] [2024-11-11 19:58:26,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:26,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:26,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:26,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:58:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:26,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:26,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:58:26,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:26,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47402063] [2024-11-11 19:58:26,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:26,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814922307] [2024-11-11 19:58:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814922307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:26,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040147500] [2024-11-11 19:58:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:26,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:26,280 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:58:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:26,331 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-11-11 19:58:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:26,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 19:58:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:26,333 INFO L225 Difference]: With dead ends: 37 [2024-11-11 19:58:26,333 INFO L226 Difference]: Without dead ends: 35 [2024-11-11 19:58:26,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:58:26,335 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:26,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:58:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-11 19:58:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-11 19:58:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-11 19:58:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-11-11 19:58:26,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 10 [2024-11-11 19:58:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:26,348 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-11-11 19:58:26,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:58:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-11-11 19:58:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 19:58:26,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:26,349 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:26,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:58:26,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:26,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:26,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2084809189, now seen corresponding path program 1 times [2024-11-11 19:58:26,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:26,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132418551] [2024-11-11 19:58:26,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:26,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:26,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740261059] [2024-11-11 19:58:26,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:26,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:26,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:26,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:58:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:26,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:26,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:58:26,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:26,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132418551] [2024-11-11 19:58:26,663 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740261059] [2024-11-11 19:58:26,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740261059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:26,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:26,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802562455] [2024-11-11 19:58:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:26,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:26,666 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:58:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:26,740 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2024-11-11 19:58:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-11 19:58:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:26,743 INFO L225 Difference]: With dead ends: 50 [2024-11-11 19:58:26,745 INFO L226 Difference]: Without dead ends: 47 [2024-11-11 19:58:26,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:58:26,746 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:26,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-11 19:58:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-11 19:58:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 19:58:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-11-11 19:58:26,759 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 15 [2024-11-11 19:58:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:26,759 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-11 19:58:26,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:58:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2024-11-11 19:58:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 19:58:26,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:26,761 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:26,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:58:26,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-11 19:58:26,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:26,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2002825724, now seen corresponding path program 1 times [2024-11-11 19:58:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305721352] [2024-11-11 19:58:26,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:26,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65300523] [2024-11-11 19:58:26,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:26,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:26,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:26,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:26,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:58:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:27,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:58:27,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305721352] [2024-11-11 19:58:27,091 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65300523] [2024-11-11 19:58:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65300523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:27,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578735279] [2024-11-11 19:58:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:27,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:27,095 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:58:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:27,174 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2024-11-11 19:58:27,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-11 19:58:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:27,176 INFO L225 Difference]: With dead ends: 75 [2024-11-11 19:58:27,176 INFO L226 Difference]: Without dead ends: 73 [2024-11-11 19:58:27,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:58:27,177 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:27,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-11 19:58:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-11-11 19:58:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-11 19:58:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-11 19:58:27,201 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 23 [2024-11-11 19:58:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:27,201 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-11 19:58:27,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:58:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-11 19:58:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 19:58:27,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:27,202 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:27,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 19:58:27,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:27,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:27,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash -840648207, now seen corresponding path program 1 times [2024-11-11 19:58:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:27,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332724357] [2024-11-11 19:58:27,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:27,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 19:58:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:58:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:58:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332724357] [2024-11-11 19:58:27,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332724357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:27,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:27,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:58:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607321280] [2024-11-11 19:58:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:27,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:58:27,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:58:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:27,548 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:58:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:27,585 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2024-11-11 19:58:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-11 19:58:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:27,590 INFO L225 Difference]: With dead ends: 105 [2024-11-11 19:58:27,590 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 19:58:27,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:58:27,591 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:27,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 92 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:58:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 19:58:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-11 19:58:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.25) internal successors, (55), 46 states have internal predecessors, (55), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-11 19:58:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2024-11-11 19:58:27,611 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 26 [2024-11-11 19:58:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:27,611 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2024-11-11 19:58:27,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:58:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2024-11-11 19:58:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 19:58:27,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:27,613 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:27,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 19:58:27,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:27,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2012484164, now seen corresponding path program 1 times [2024-11-11 19:58:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564938201] [2024-11-11 19:58:27,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 19:58:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:58:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:58:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 19:58:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 19:58:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564938201] [2024-11-11 19:58:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564938201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:58:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 19:58:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88788210] [2024-11-11 19:58:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:27,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 19:58:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 19:58:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:58:27,934 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:58:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:28,026 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-11-11 19:58:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:58:28,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-11 19:58:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:28,029 INFO L225 Difference]: With dead ends: 76 [2024-11-11 19:58:28,029 INFO L226 Difference]: Without dead ends: 74 [2024-11-11 19:58:28,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:58:28,030 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:28,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 108 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-11 19:58:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-11 19:58:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-11 19:58:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2024-11-11 19:58:28,050 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 33 [2024-11-11 19:58:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:28,050 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-11 19:58:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:58:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2024-11-11 19:58:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 19:58:28,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:28,052 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:28,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 19:58:28,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:28,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2020901362, now seen corresponding path program 1 times [2024-11-11 19:58:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:28,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349731863] [2024-11-11 19:58:28,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 19:58:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:58:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:58:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 19:58:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 19:58:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 19:58:28,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349731863] [2024-11-11 19:58:28,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349731863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212024625] [2024-11-11 19:58:28,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:28,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:28,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:28,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:28,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:58:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:28,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 19:58:28,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:58:28,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212024625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:58:28,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:58:28,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-11 19:58:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247063750] [2024-11-11 19:58:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:28,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:58:28,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:28,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:58:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:58:28,462 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 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-11-11 19:58:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:28,568 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2024-11-11 19:58:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:58:28,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 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 39 [2024-11-11 19:58:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:28,571 INFO L225 Difference]: With dead ends: 87 [2024-11-11 19:58:28,571 INFO L226 Difference]: Without dead ends: 85 [2024-11-11 19:58:28,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:58:28,572 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:28,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 155 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-11 19:58:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2024-11-11 19:58:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.22) internal successors, (61), 54 states have internal predecessors, (61), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-11 19:58:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2024-11-11 19:58:28,594 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 39 [2024-11-11 19:58:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:28,595 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2024-11-11 19:58:28,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 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-11-11 19:58:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2024-11-11 19:58:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 19:58:28,596 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:28,596 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 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-11-11 19:58:28,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 19:58:28,801 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-11-11 19:58:28,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash 803844641, now seen corresponding path program 1 times [2024-11-11 19:58:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816405764] [2024-11-11 19:58:28,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 19:58:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:58:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:58:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 19:58:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 19:58:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 19:58:28,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:28,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816405764] [2024-11-11 19:58:28,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816405764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:28,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472619507] [2024-11-11 19:58:28,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:28,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:28,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:28,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:28,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:58:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:28,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:58:28,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 19:58:29,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 19:58:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472619507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:58:29,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:58:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-11 19:58:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136846222] [2024-11-11 19:58:29,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:58:29,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 19:58:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:29,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 19:58:29,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:58:29,133 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 19:58:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:29,339 INFO L93 Difference]: Finished difference Result 247 states and 304 transitions. [2024-11-11 19:58:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 19:58:29,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 42 [2024-11-11 19:58:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:29,342 INFO L225 Difference]: With dead ends: 247 [2024-11-11 19:58:29,342 INFO L226 Difference]: Without dead ends: 240 [2024-11-11 19:58:29,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-11 19:58:29,344 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:29,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 176 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-11 19:58:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 224. [2024-11-11 19:58:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 144 states have (on average 1.2013888888888888) internal successors, (173), 153 states have internal predecessors, (173), 55 states have call successors, (55), 24 states have call predecessors, (55), 24 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-11 19:58:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 279 transitions. [2024-11-11 19:58:29,399 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 279 transitions. Word has length 42 [2024-11-11 19:58:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:29,400 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 279 transitions. [2024-11-11 19:58:29,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 19:58:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 279 transitions. [2024-11-11 19:58:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 19:58:29,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:29,402 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:29,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 19:58:29,606 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-11-11 19:58:29,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:29,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:29,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1528082637, now seen corresponding path program 1 times [2024-11-11 19:58:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:29,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484581782] [2024-11-11 19:58:29,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:29,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 19:58:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753902790] [2024-11-11 19:58:29,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:29,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:29,624 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:58:29,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:58:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:29,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 19:58:29,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 19:58:30,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 19:58:30,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484581782] [2024-11-11 19:58:30,278 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 19:58:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753902790] [2024-11-11 19:58:30,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753902790] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:30,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:58:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2024-11-11 19:58:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673966154] [2024-11-11 19:58:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:58:30,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 19:58:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 19:58:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:58:30,280 INFO L87 Difference]: Start difference. First operand 224 states and 279 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 19:58:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:30,409 INFO L93 Difference]: Finished difference Result 242 states and 296 transitions. [2024-11-11 19:58:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:58:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2024-11-11 19:58:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:30,430 INFO L225 Difference]: With dead ends: 242 [2024-11-11 19:58:30,430 INFO L226 Difference]: Without dead ends: 236 [2024-11-11 19:58:30,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-11 19:58:30,432 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:30,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 95 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-11 19:58:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 171. [2024-11-11 19:58:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 117 states have internal predecessors, (127), 36 states have call successors, (36), 22 states have call predecessors, (36), 22 states have return successors, (36), 31 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-11 19:58:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2024-11-11 19:58:30,482 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 47 [2024-11-11 19:58:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:30,484 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2024-11-11 19:58:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 19:58:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2024-11-11 19:58:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 19:58:30,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:58:30,490 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 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] [2024-11-11 19:58:30,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 19:58:30,691 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-11-11 19:58:30,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:58:30,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:58:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1339763981, now seen corresponding path program 1 times [2024-11-11 19:58:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:58:30,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093669198] [2024-11-11 19:58:30,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:58:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 19:58:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:58:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:58:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 19:58:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 19:58:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 19:58:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 19:58:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 19:58:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 19:58:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-11 19:58:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:58:30,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093669198] [2024-11-11 19:58:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093669198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:58:30,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818291362] [2024-11-11 19:58:30,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:58:30,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:58:30,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:58:30,874 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-11-11 19:58:30,876 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-11-11 19:58:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:58:30,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 19:58:30,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:58:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-11 19:58:30,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:58:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-11 19:58:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818291362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:58:31,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:58:31,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2024-11-11 19:58:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129031203] [2024-11-11 19:58:31,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:58:31,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:58:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:58:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:58:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:58:31,070 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 19:58:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:58:31,198 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2024-11-11 19:58:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:58:31,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 63 [2024-11-11 19:58:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:58:31,200 INFO L225 Difference]: With dead ends: 183 [2024-11-11 19:58:31,200 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 19:58:31,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:58:31,201 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:58:31,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:58:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 19:58:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 19:58:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:58:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 19:58:31,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2024-11-11 19:58:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:58:31,203 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 19:58:31,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 19:58:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 19:58:31,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 19:58:31,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:58:31,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 19:58:31,406 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-11-11 19:58:31,409 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:58:31,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 19:58:32,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:58:32,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:58:32 BoogieIcfgContainer [2024-11-11 19:58:32,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:58:32,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:58:32,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:58:32,429 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:58:32,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:58:25" (3/4) ... [2024-11-11 19:58:32,432 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 19:58:32,436 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-11 19:58:32,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-11 19:58:32,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 19:58:32,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 19:58:32,441 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 19:58:32,529 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:58:32,529 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 19:58:32,529 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:58:32,530 INFO L158 Benchmark]: Toolchain (without parser) took 7829.80ms. Allocated memory was 140.5MB in the beginning and 224.4MB in the end (delta: 83.9MB). Free memory was 69.1MB in the beginning and 91.2MB in the end (delta: -22.1MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-11-11 19:58:32,530 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:58:32,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.37ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 68.9MB in the beginning and 154.9MB in the end (delta: -86.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-11 19:58:32,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.89ms. Allocated memory is still 186.6MB. Free memory was 154.9MB in the beginning and 153.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:58:32,530 INFO L158 Benchmark]: Boogie Preprocessor took 32.63ms. Allocated memory is still 186.6MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:58:32,531 INFO L158 Benchmark]: RCFGBuilder took 355.01ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 139.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:58:32,531 INFO L158 Benchmark]: TraceAbstraction took 7022.08ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 139.2MB in the beginning and 96.4MB in the end (delta: 42.8MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-11-11 19:58:32,531 INFO L158 Benchmark]: Witness Printer took 100.50ms. Allocated memory is still 224.4MB. Free memory was 96.4MB in the beginning and 91.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:58:32,533 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.19ms. Allocated memory is still 140.5MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.37ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 68.9MB in the beginning and 154.9MB in the end (delta: -86.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.89ms. Allocated memory is still 186.6MB. Free memory was 154.9MB in the beginning and 153.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.63ms. Allocated memory is still 186.6MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.01ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 139.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7022.08ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 139.2MB in the beginning and 96.4MB in the end (delta: 42.8MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * Witness Printer took 100.50ms. Allocated memory is still 224.4MB. Free memory was 96.4MB in the beginning and 91.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 1165 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 837 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 328 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 406 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=9, InterpolantAutomatonStates: 65, 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, 11 MinimizatonAttempts, 97 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 1574 SizeOfPredicates, 13 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 905/967 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: ((((((__int128) a * y) == b) && (1 <= y)) && (1 <= r)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((x == (r + ((__int128) q * y))) && (1 <= y)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: ((cond != 0) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-11-11 19:58:32,553 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