./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/ps5-ll_valuebound100.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 2436c69c19f049d89ef519f7bd9d4cf3f7b648737fca21472b0299c532d84f11 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:53:48,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:53:48,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:53:48,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:53:48,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:53:48,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:53:48,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:53:48,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:53:48,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:53:48,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:53:48,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:53:48,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:53:48,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:53:48,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:53:48,112 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:53:48,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:53:48,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:53:48,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:53:48,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:53:48,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:53:48,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:53:48,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:53:48,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:53:48,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:53:48,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:53:48,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:53:48,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:53:48,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:53:48,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:53:48,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:53:48,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:53:48,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:53:48,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:53:48,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:53:48,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:53:48,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:53:48,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:53:48,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:53:48,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:53:48,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:53:48,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:53:48,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:53:48,125 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 -> 2436c69c19f049d89ef519f7bd9d4cf3f7b648737fca21472b0299c532d84f11 [2024-11-09 22:53:48,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:53:48,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:53:48,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:53:48,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:53:48,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:53:48,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c [2024-11-09 22:53:49,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:53:49,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:53:49,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c [2024-11-09 22:53:50,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9503bf639/3b0e20d8b7194563a178286a08ec97bb/FLAG4f6c2feef [2024-11-09 22:53:50,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9503bf639/3b0e20d8b7194563a178286a08ec97bb [2024-11-09 22:53:50,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:53:50,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:53:50,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:53:50,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:53:50,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:53:50,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614ae97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50, skipping insertion in model container [2024-11-09 22:53:50,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:53:50,214 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/ps5-ll_valuebound100.c[458,471] [2024-11-09 22:53:50,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:53:50,240 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:53:50,252 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/ps5-ll_valuebound100.c[458,471] [2024-11-09 22:53:50,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:53:50,276 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:53:50,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50 WrapperNode [2024-11-09 22:53:50,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:53:50,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:53:50,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:53:50,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:53:50,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,308 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2024-11-09 22:53:50,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:53:50,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:53:50,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:53:50,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:53:50,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,330 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-09 22:53:50,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:53:50,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:53:50,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:53:50,345 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:53:50,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (1/1) ... [2024-11-09 22:53:50,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:53:50,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:53:50,386 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-09 22:53:50,389 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-09 22:53:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:53:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 22:53:50,437 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 22:53:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:53:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:53:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:53:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:53:50,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:53:50,503 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:53:50,505 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:53:50,693 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 22:53:50,693 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:53:50,704 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:53:50,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:53:50,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:53:50 BoogieIcfgContainer [2024-11-09 22:53:50,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:53:50,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:53:50,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:53:50,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:53:50,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:53:50" (1/3) ... [2024-11-09 22:53:50,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a573375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:53:50, skipping insertion in model container [2024-11-09 22:53:50,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:53:50" (2/3) ... [2024-11-09 22:53:50,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a573375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:53:50, skipping insertion in model container [2024-11-09 22:53:50,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:53:50" (3/3) ... [2024-11-09 22:53:50,714 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound100.c [2024-11-09 22:53:50,729 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:53:50,729 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:53:50,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:53:50,789 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;@20eefa17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:53:50,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:53:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:53:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:53:50,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:53:50,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:53:50,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:53:50,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:53:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1686742115, now seen corresponding path program 1 times [2024-11-09 22:53:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:53:50,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628276236] [2024-11-09 22:53:50,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:53:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:53:50,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:53:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:53:50,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:53:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:53:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:53:51,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:53:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628276236] [2024-11-09 22:53:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628276236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:53:51,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:53:51,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:53:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998462456] [2024-11-09 22:53:51,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:53:51,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:53:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:53:51,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:53:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:53:51,042 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:53:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:53:51,060 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2024-11-09 22:53:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:53:51,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-09 22:53:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:53:51,069 INFO L225 Difference]: With dead ends: 49 [2024-11-09 22:53:51,069 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 22:53:51,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:53:51,077 INFO L432 NwaCegarLoop]: 29 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, 29 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-09 22:53:51,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:53:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 22:53:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 22:53:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:53:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 22:53:51,115 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2024-11-09 22:53:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:53:51,115 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 22:53:51,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:53:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 22:53:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:53:51,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:53:51,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:53:51,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:53:51,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:53:51,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:53:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1225136495, now seen corresponding path program 1 times [2024-11-09 22:53:51,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:53:51,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499430646] [2024-11-09 22:53:51,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:51,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:53:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:53:51,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106507557] [2024-11-09 22:53:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:51,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:53:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:53:51,166 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-09 22:53:51,167 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-09 22:53:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:53:51,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:53:51,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:53:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:53:51,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:53:51,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:53:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499430646] [2024-11-09 22:53:51,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:53:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106507557] [2024-11-09 22:53:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106507557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:53:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:53:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:53:51,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590133723] [2024-11-09 22:53:51,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:53:51,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:53:51,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:53:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:53:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:53:51,400 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-09 22:53:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:53:51,464 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-09 22:53:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:53:51,465 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), 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 20 [2024-11-09 22:53:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:53:51,466 INFO L225 Difference]: With dead ends: 35 [2024-11-09 22:53:51,466 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 22:53:51,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-09 22:53:51,468 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:53:51,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:53:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 22:53:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 22:53:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:53:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-09 22:53:51,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 20 [2024-11-09 22:53:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:53:51,481 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-09 22:53:51,481 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), 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-09 22:53:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-09 22:53:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:53:51,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:53:51,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:53:51,499 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-09 22:53:51,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:53:51,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:53:51,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:53:51,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1863893392, now seen corresponding path program 1 times [2024-11-09 22:53:51,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:53:51,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810652522] [2024-11-09 22:53:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:53:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:53:51,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596831402] [2024-11-09 22:53:51,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:51,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:53:51,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:53:51,724 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-09 22:53:51,727 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-09 22:53:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:53:51,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:53:51,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:53:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:53:51,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:53:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:53:52,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:53:52,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810652522] [2024-11-09 22:53:52,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:53:52,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596831402] [2024-11-09 22:53:52,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596831402] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 22:53:52,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:53:52,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-09 22:53:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958518704] [2024-11-09 22:53:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:53:52,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:53:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:53:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:53:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:53:52,022 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:53:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:53:52,068 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-11-09 22:53:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:53:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-09 22:53:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:53:52,069 INFO L225 Difference]: With dead ends: 37 [2024-11-09 22:53:52,070 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 22:53:52,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:53:52,071 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:53:52,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:53:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 22:53:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 22:53:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:53:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-11-09 22:53:52,083 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2024-11-09 22:53:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:53:52,083 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-09 22:53:52,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:53:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-11-09 22:53:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 22:53:52,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:53:52,085 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:53:52,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 22:53:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 22:53:52,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:53:52,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:53:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1980041958, now seen corresponding path program 1 times [2024-11-09 22:53:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:53:52,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238556156] [2024-11-09 22:53:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:53:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:53:52,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225426604] [2024-11-09 22:53:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:52,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:53:52,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:53:52,325 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-09 22:53:52,329 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-09 22:53:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:53:52,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 22:53:52,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:53:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:53:52,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:53:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:53:52,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:53:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238556156] [2024-11-09 22:53:52,663 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:53:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225426604] [2024-11-09 22:53:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225426604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:53:52,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:53:52,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-09 22:53:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548110164] [2024-11-09 22:53:52,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:53:52,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:53:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:53:52,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:53:52,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:53:52,667 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 22:53:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:53:52,852 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-09 22:53:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:53:52,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 39 [2024-11-09 22:53:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:53:52,854 INFO L225 Difference]: With dead ends: 53 [2024-11-09 22:53:52,854 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 22:53:52,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:53:52,857 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:53:52,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 198 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:53:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 22:53:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 22:53:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:53:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-09 22:53:52,878 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2024-11-09 22:53:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:53:52,879 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-09 22:53:52,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 22:53:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-09 22:53:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 22:53:52,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:53:52,881 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:53:52,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:53:53,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:53:53,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:53:53,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:53:53,086 INFO L85 PathProgramCache]: Analyzing trace with hash 327609507, now seen corresponding path program 2 times [2024-11-09 22:53:53,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:53:53,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702655850] [2024-11-09 22:53:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:53,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:53:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:53:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418616307] [2024-11-09 22:53:53,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:53:53,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:53:53,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:53:53,165 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-09 22:53:53,166 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-09 22:53:53,255 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:53:53,255 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:53:53,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 22:53:53,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:53:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 22:53:53,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:53:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 22:53:53,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:53:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702655850] [2024-11-09 22:53:53,919 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:53:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418616307] [2024-11-09 22:53:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418616307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:53:53,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:53:53,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-11-09 22:53:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841905445] [2024-11-09 22:53:53,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:53:53,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 22:53:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:53:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 22:53:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-11-09 22:53:53,927 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 21 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-09 22:53:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:53:54,509 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-11-09 22:53:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 22:53:54,509 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) Word has length 63 [2024-11-09 22:53:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:53:54,511 INFO L225 Difference]: With dead ends: 75 [2024-11-09 22:53:54,511 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 22:53:54,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2024-11-09 22:53:54,513 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:53:54,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 371 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:53:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 22:53:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-09 22:53:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 22:53:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2024-11-09 22:53:54,540 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 63 [2024-11-09 22:53:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:53:54,540 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-11-09 22:53:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-09 22:53:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-11-09 22:53:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 22:53:54,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:53:54,543 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:53:54,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 22:53:54,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:53:54,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:53:54,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:53:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1085687586, now seen corresponding path program 3 times [2024-11-09 22:53:54,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:53:54,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700789849] [2024-11-09 22:53:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:53:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:53:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:53:54,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493007839] [2024-11-09 22:53:54,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:53:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:53:54,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:53:54,860 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-09 22:53:54,861 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-09 22:53:55,060 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-09 22:53:55,060 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:53:55,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 22:53:55,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:53:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 30 proven. 202 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-09 22:53:55,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:54:03,826 WARN L851 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 6) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 6))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2024-11-09 22:54:15,908 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 22:54:31,932 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 22:54:35,946 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6)) 30) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| 6)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6)))))) is different from true [2024-11-09 22:54:51,987 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 22:55:08,397 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 22:55:12,418 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6)) 30) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| 6)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-11-09 22:55:28,470 WARN L851 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 7)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 7) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false