./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/array-lopstr16/flag_loopdep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea0eb860624f2529729bf06b2cf9cdf66fc11dde388f7654e825b0ff58526d73 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:11:44,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:11:44,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:11:44,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:11:44,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:11:44,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:11:44,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:11:44,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:11:44,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:11:44,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:11:44,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:11:44,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:11:44,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:11:44,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:11:44,562 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:11:44,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:11:44,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:11:44,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:11:44,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:11:44,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:11:44,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:11:44,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:11:44,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:11:44,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:11:44,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:11:44,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:11:44,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:11:44,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:11:44,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:11:44,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:11:44,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:11:44,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:11:44,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:11:44,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:11:44,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:11:44,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:11:44,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:11:44,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:11:44,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:11:44,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:11:44,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:11:44,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:11:44,570 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 -> ea0eb860624f2529729bf06b2cf9cdf66fc11dde388f7654e825b0ff58526d73 [2024-11-08 10:11:44,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:11:44,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:11:44,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:11:44,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:11:44,789 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:11:44,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2024-11-08 10:11:46,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:11:46,150 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:11:46,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2024-11-08 10:11:46,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27996e95/0cd20eed8aae4721bac7d5109b5d6157/FLAG71fe223dd [2024-11-08 10:11:46,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27996e95/0cd20eed8aae4721bac7d5109b5d6157 [2024-11-08 10:11:46,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:11:46,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:11:46,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:11:46,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:11:46,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:11:46,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a37d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46, skipping insertion in model container [2024-11-08 10:11:46,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:11:46,312 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/array-lopstr16/flag_loopdep.i[805,818] [2024-11-08 10:11:46,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:11:46,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:11:46,348 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/array-lopstr16/flag_loopdep.i[805,818] [2024-11-08 10:11:46,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:11:46,366 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:11:46,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46 WrapperNode [2024-11-08 10:11:46,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:11:46,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:11:46,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:11:46,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:11:46,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,396 INFO L138 Inliner]: procedures = 21, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-08 10:11:46,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:11:46,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:11:46,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:11:46,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:11:46,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,421 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-08 10:11:46,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:11:46,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:11:46,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:11:46,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:11:46,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (1/1) ... [2024-11-08 10:11:46,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:11:46,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:46,476 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-08 10:11:46,479 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-08 10:11:46,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 10:11:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 10:11:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:11:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:11:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 10:11:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 10:11:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 10:11:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 10:11:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 10:11:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:11:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:11:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 10:11:46,608 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:11:46,610 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:11:46,737 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 10:11:46,737 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:11:46,747 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:11:46,747 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 10:11:46,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:11:46 BoogieIcfgContainer [2024-11-08 10:11:46,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:11:46,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:11:46,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:11:46,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:11:46,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:11:46" (1/3) ... [2024-11-08 10:11:46,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82e20fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:11:46, skipping insertion in model container [2024-11-08 10:11:46,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:11:46" (2/3) ... [2024-11-08 10:11:46,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82e20fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:11:46, skipping insertion in model container [2024-11-08 10:11:46,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:11:46" (3/3) ... [2024-11-08 10:11:46,758 INFO L112 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2024-11-08 10:11:46,772 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:11:46,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:11:46,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:11:46,833 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;@62099c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:11:46,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:11:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-08 10:11:46,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 10:11:46,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:46,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:46,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2024-11-08 10:11:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:46,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687185440] [2024-11-08 10:11:46,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:47,106 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-08 10:11:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687185440] [2024-11-08 10:11:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687185440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:11:47,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:11:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:11:47,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260382131] [2024-11-08 10:11:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:11:47,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:11:47,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:11:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:11:47,136 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 10:11:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:47,167 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2024-11-08 10:11:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:11:47,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2024-11-08 10:11:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:47,188 INFO L225 Difference]: With dead ends: 38 [2024-11-08 10:11:47,189 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 10:11:47,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:11:47,204 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:47,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:11:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 10:11:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-08 10:11:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-08 10:11:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-08 10:11:47,255 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2024-11-08 10:11:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:47,256 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-08 10:11:47,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 10:11:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-08 10:11:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 10:11:47,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:47,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:11:47,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:47,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1264138591, now seen corresponding path program 1 times [2024-11-08 10:11:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:47,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573618074] [2024-11-08 10:11:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 10:11:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:47,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573618074] [2024-11-08 10:11:47,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573618074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:11:47,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:11:47,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:11:47,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935014626] [2024-11-08 10:11:47,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:11:47,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:11:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:47,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:11:47,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:11:47,338 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 10:11:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:47,365 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-08 10:11:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:11:47,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2024-11-08 10:11:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:47,366 INFO L225 Difference]: With dead ends: 35 [2024-11-08 10:11:47,366 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 10:11:47,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:11:47,368 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:47,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:11:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 10:11:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2024-11-08 10:11:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-08 10:11:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-08 10:11:47,372 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2024-11-08 10:11:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:47,373 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-08 10:11:47,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 10:11:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-08 10:11:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 10:11:47,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:47,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:47,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:11:47,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:47,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1458340319, now seen corresponding path program 1 times [2024-11-08 10:11:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159649425] [2024-11-08 10:11:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 10:11:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159649425] [2024-11-08 10:11:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159649425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370820282] [2024-11-08 10:11:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:47,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:47,469 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-08 10:11:47,470 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-08 10:11:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:47,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:11:47,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 10:11:47,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:11:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370820282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:11:47,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:11:47,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 10:11:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015806644] [2024-11-08 10:11:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:11:47,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:11:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:11:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:11:47,587 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 10:11:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:47,601 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-11-08 10:11:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:11:47,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2024-11-08 10:11:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:47,602 INFO L225 Difference]: With dead ends: 32 [2024-11-08 10:11:47,602 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 10:11:47,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-08 10:11:47,603 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:47,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:11:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 10:11:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 10:11:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-08 10:11:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-08 10:11:47,607 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2024-11-08 10:11:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:47,607 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-08 10:11:47,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 10:11:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-08 10:11:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 10:11:47,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:47,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:47,627 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-08 10:11:47,809 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-08 10:11:47,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:47,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2024-11-08 10:11:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408070414] [2024-11-08 10:11:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 10:11:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408070414] [2024-11-08 10:11:47,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408070414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529541515] [2024-11-08 10:11:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:47,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:47,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:47,869 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-08 10:11:47,871 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-08 10:11:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:47,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:11:47,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 10:11:47,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:11:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 10:11:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529541515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:11:47,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:11:47,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-08 10:11:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673875338] [2024-11-08 10:11:47,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:11:47,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:11:47,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:11:47,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:11:47,993 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-08 10:11:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:48,050 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-08 10:11:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:11:48,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) Word has length 15 [2024-11-08 10:11:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:48,051 INFO L225 Difference]: With dead ends: 56 [2024-11-08 10:11:48,052 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 10:11:48,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:11:48,054 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:48,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:11:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 10:11:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2024-11-08 10:11:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-08 10:11:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-08 10:11:48,061 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 15 [2024-11-08 10:11:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:48,061 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-08 10:11:48,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-08 10:11:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-08 10:11:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 10:11:48,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:48,062 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:48,079 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-08 10:11:48,262 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-08 10:11:48,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:48,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 2 times [2024-11-08 10:11:48,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:48,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619493069] [2024-11-08 10:11:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:11:48,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619493069] [2024-11-08 10:11:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619493069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:48,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531411601] [2024-11-08 10:11:48,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:11:48,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:48,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:48,454 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-08 10:11:48,455 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-08 10:11:48,529 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:11:48,529 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:11:48,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 10:11:48,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:11:48,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:11:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:11:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531411601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:11:48,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:11:48,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-08 10:11:48,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020458132] [2024-11-08 10:11:48,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:11:48,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 10:11:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:48,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 10:11:48,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:11:48,739 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-08 10:11:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:48,771 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-08 10:11:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 10:11:48,772 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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) Word has length 24 [2024-11-08 10:11:48,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:48,773 INFO L225 Difference]: With dead ends: 55 [2024-11-08 10:11:48,773 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 10:11:48,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:11:48,774 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:48,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:11:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 10:11:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 10:11:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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-08 10:11:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-08 10:11:48,778 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2024-11-08 10:11:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:48,778 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-08 10:11:48,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 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-08 10:11:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-08 10:11:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 10:11:48,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:48,779 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:48,791 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-08 10:11:48,983 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-08 10:11:48,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:48,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2120045553, now seen corresponding path program 3 times [2024-11-08 10:11:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:48,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229195588] [2024-11-08 10:11:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:11:49,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:49,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229195588] [2024-11-08 10:11:49,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229195588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269481552] [2024-11-08 10:11:49,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 10:11:49,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:49,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:49,298 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-08 10:11:49,299 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-08 10:11:49,386 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 10:11:49,386 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:11:49,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:11:49,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 10:11:49,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:11:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 10:11:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269481552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:11:49,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:11:49,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2024-11-08 10:11:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464456058] [2024-11-08 10:11:49,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:11:49,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 10:11:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 10:11:49,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:11:49,472 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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-08 10:11:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:49,597 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2024-11-08 10:11:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 10:11:49,598 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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) Word has length 36 [2024-11-08 10:11:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:49,598 INFO L225 Difference]: With dead ends: 106 [2024-11-08 10:11:49,600 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 10:11:49,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:11:49,601 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:49,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 95 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:11:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 10:11:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2024-11-08 10:11:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 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-08 10:11:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-11-08 10:11:49,611 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2024-11-08 10:11:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:49,612 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-08 10:11:49,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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-08 10:11:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-11-08 10:11:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:11:49,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:49,613 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:49,625 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-08 10:11:49,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:49,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1925935603, now seen corresponding path program 4 times [2024-11-08 10:11:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929067199] [2024-11-08 10:11:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 10:11:49,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:49,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929067199] [2024-11-08 10:11:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929067199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:49,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124647001] [2024-11-08 10:11:49,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 10:11:49,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:49,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:49,960 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-08 10:11:49,961 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-08 10:11:50,182 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 10:11:50,182 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:11:50,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 10:11:50,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 10:11:50,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:11:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 10:11:50,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124647001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:11:50,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:11:50,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-08 10:11:50,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942219811] [2024-11-08 10:11:50,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:11:50,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 10:11:50,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:50,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 10:11:50,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:11:50,310 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 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-08 10:11:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:50,442 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2024-11-08 10:11:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 10:11:50,442 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 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) Word has length 50 [2024-11-08 10:11:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:50,445 INFO L225 Difference]: With dead ends: 177 [2024-11-08 10:11:50,445 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 10:11:50,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:11:50,446 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 179 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:50,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 118 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:11:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 10:11:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 77. [2024-11-08 10:11:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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-08 10:11:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-08 10:11:50,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 50 [2024-11-08 10:11:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:50,461 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-08 10:11:50,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 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-08 10:11:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-08 10:11:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 10:11:50,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:50,464 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:50,479 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-08 10:11:50,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:50,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:50,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2026747379, now seen corresponding path program 5 times [2024-11-08 10:11:50,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:50,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190681987] [2024-11-08 10:11:50,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 10:11:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190681987] [2024-11-08 10:11:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190681987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964795043] [2024-11-08 10:11:50,965 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 10:11:50,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:50,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:50,967 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-08 10:11:50,969 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-08 10:11:52,991 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-11-08 10:11:52,991 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:11:52,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 10:11:52,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 10:11:53,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:11:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 10:11:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964795043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:11:53,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:11:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2024-11-08 10:11:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096328786] [2024-11-08 10:11:53,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:11:53,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-08 10:11:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-08 10:11:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 10:11:53,363 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 33 states, 33 states have (on average 3.090909090909091) internal successors, (102), 33 states have internal predecessors, (102), 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-08 10:11:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:53,588 INFO L93 Difference]: Finished difference Result 337 states and 386 transitions. [2024-11-08 10:11:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 10:11:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.090909090909091) internal successors, (102), 33 states have internal predecessors, (102), 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) Word has length 74 [2024-11-08 10:11:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:53,591 INFO L225 Difference]: With dead ends: 337 [2024-11-08 10:11:53,591 INFO L226 Difference]: Without dead ends: 329 [2024-11-08 10:11:53,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 10:11:53,591 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 536 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:53,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 226 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:11:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-08 10:11:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 125. [2024-11-08 10:11:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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-08 10:11:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2024-11-08 10:11:53,606 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 74 [2024-11-08 10:11:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:53,607 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2024-11-08 10:11:53,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.090909090909091) internal successors, (102), 33 states have internal predecessors, (102), 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-08 10:11:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2024-11-08 10:11:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 10:11:53,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:53,611 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:53,627 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-08 10:11:53,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:53,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:53,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1272037901, now seen corresponding path program 6 times [2024-11-08 10:11:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050131121] [2024-11-08 10:11:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2024-11-08 10:11:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050131121] [2024-11-08 10:11:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050131121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466584241] [2024-11-08 10:11:54,127 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 10:11:54,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:54,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:54,129 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-08 10:11:54,130 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-08 10:11:54,228 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-08 10:11:54,229 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:11:54,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 10:11:54,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1397 trivial. 0 not checked. [2024-11-08 10:11:54,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:11:55,067 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 10:11:55,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2024-11-08 10:11:55,076 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 10:11:55,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-08 10:11:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 1397 trivial. 0 not checked. [2024-11-08 10:11:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466584241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:11:55,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:11:55,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 25 [2024-11-08 10:11:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497090599] [2024-11-08 10:11:55,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:11:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 10:11:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:55,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 10:11:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2024-11-08 10:11:55,093 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-08 10:11:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:55,344 INFO L93 Difference]: Finished difference Result 233 states and 241 transitions. [2024-11-08 10:11:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 10:11:55,345 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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) Word has length 122 [2024-11-08 10:11:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:55,346 INFO L225 Difference]: With dead ends: 233 [2024-11-08 10:11:55,346 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 10:11:55,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 10:11:55,348 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:55,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 76 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:11:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 10:11:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-08 10:11:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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-08 10:11:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2024-11-08 10:11:55,362 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 122 [2024-11-08 10:11:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:55,362 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2024-11-08 10:11:55,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-08 10:11:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2024-11-08 10:11:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 10:11:55,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:55,364 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:55,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 10:11:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:55,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 263851330, now seen corresponding path program 1 times [2024-11-08 10:11:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343634982] [2024-11-08 10:11:55,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1479 trivial. 0 not checked. [2024-11-08 10:11:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343634982] [2024-11-08 10:11:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343634982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:11:55,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:11:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:11:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597588312] [2024-11-08 10:11:55,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:11:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:11:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:55,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:11:55,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:11:55,646 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 10:11:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:55,655 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2024-11-08 10:11:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:11:55,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 127 [2024-11-08 10:11:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:55,655 INFO L225 Difference]: With dead ends: 137 [2024-11-08 10:11:55,656 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 10:11:55,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:11:55,656 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:55,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:11:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 10:11:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-08 10:11:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.0232558139534884) internal successors, (132), 129 states have internal predecessors, (132), 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-08 10:11:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2024-11-08 10:11:55,662 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 127 [2024-11-08 10:11:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:55,663 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2024-11-08 10:11:55,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 10:11:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2024-11-08 10:11:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 10:11:55,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:55,664 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:55,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:11:55,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:55,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 74041612, now seen corresponding path program 1 times [2024-11-08 10:11:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192442973] [2024-11-08 10:11:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-08 10:11:56,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:56,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192442973] [2024-11-08 10:11:56,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192442973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:56,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105593866] [2024-11-08 10:11:56,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:56,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:56,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:56,040 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:11:56,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 10:11:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:56,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 10:11:56,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-08 10:11:56,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:11:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-08 10:11:56,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105593866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:11:56,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:11:56,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2024-11-08 10:11:56,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283720606] [2024-11-08 10:11:56,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:11:56,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-08 10:11:56,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:56,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-08 10:11:56,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 10:11:56,772 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 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-08 10:11:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:11:56,840 INFO L93 Difference]: Finished difference Result 261 states and 278 transitions. [2024-11-08 10:11:56,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 10:11:56,840 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 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) Word has length 129 [2024-11-08 10:11:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:11:56,841 INFO L225 Difference]: With dead ends: 261 [2024-11-08 10:11:56,841 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 10:11:56,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 10:11:56,842 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:11:56,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:11:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 10:11:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-08 10:11:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.019108280254777) internal successors, (160), 157 states have internal predecessors, (160), 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-08 10:11:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2024-11-08 10:11:56,849 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 129 [2024-11-08 10:11:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:11:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2024-11-08 10:11:56,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 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-08 10:11:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2024-11-08 10:11:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 10:11:56,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:11:56,851 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 26, 26, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:11:56,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 10:11:57,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 10:11:57,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:11:57,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:11:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash 68979696, now seen corresponding path program 2 times [2024-11-08 10:11:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:11:57,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783444615] [2024-11-08 10:11:57,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:11:57,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:11:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:11:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2024-11-08 10:11:57,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:11:57,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783444615] [2024-11-08 10:11:57,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783444615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:11:57,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959723684] [2024-11-08 10:11:57,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:11:57,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:11:57,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:11:57,911 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:11:57,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 10:11:58,127 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:11:58,127 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:11:58,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 10:11:58,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:11:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-08 10:11:58,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:11:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2024-11-08 10:11:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959723684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:11:59,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:11:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 29] total 87 [2024-11-08 10:11:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612773618] [2024-11-08 10:11:59,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:11:59,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-11-08 10:11:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:11:59,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-11-08 10:11:59,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2067, Invalid=5415, Unknown=0, NotChecked=0, Total=7482 [2024-11-08 10:11:59,912 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand has 87 states, 87 states have (on average 2.5057471264367814) internal successors, (218), 87 states have internal predecessors, (218), 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-08 10:12:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:00,281 INFO L93 Difference]: Finished difference Result 534 states and 566 transitions. [2024-11-08 10:12:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-08 10:12:00,282 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 2.5057471264367814) internal successors, (218), 87 states have internal predecessors, (218), 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) Word has length 157 [2024-11-08 10:12:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:00,283 INFO L225 Difference]: With dead ends: 534 [2024-11-08 10:12:00,283 INFO L226 Difference]: Without dead ends: 431 [2024-11-08 10:12:00,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2067, Invalid=5415, Unknown=0, NotChecked=0, Total=7482 [2024-11-08 10:12:00,285 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 464 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:00,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 198 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:12:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-08 10:12:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 217. [2024-11-08 10:12:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.0138888888888888) internal successors, (219), 216 states have internal predecessors, (219), 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-08 10:12:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2024-11-08 10:12:00,294 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 157 [2024-11-08 10:12:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:00,295 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2024-11-08 10:12:00,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 2.5057471264367814) internal successors, (218), 87 states have internal predecessors, (218), 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-08 10:12:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2024-11-08 10:12:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 10:12:00,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:00,297 INFO L215 NwaCegarLoop]: trace histogram [54, 54, 31, 31, 31, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:00,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 10:12:00,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:00,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:00,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash -80728372, now seen corresponding path program 3 times [2024-11-08 10:12:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040087440] [2024-11-08 10:12:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4345 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 2919 trivial. 0 not checked. [2024-11-08 10:12:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040087440] [2024-11-08 10:12:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040087440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:12:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467918274] [2024-11-08 10:12:01,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 10:12:01,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:01,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:01,744 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:12:01,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 10:12:01,978 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 10:12:01,978 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:12:01,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 10:12:01,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:12:02,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-08 10:12:02,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:12:02,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2024-11-08 10:12:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4345 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 4147 trivial. 0 not checked. [2024-11-08 10:12:02,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:12:02,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-11-08 10:12:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4345 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 4147 trivial. 0 not checked. [2024-11-08 10:12:03,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467918274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:12:03,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:12:03,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 9, 9] total 45 [2024-11-08 10:12:03,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733384621] [2024-11-08 10:12:03,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:12:03,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-08 10:12:03,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:03,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-08 10:12:03,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=1256, Unknown=0, NotChecked=0, Total=1980 [2024-11-08 10:12:03,297 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 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-08 10:12:07,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 10:12:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:08,080 INFO L93 Difference]: Finished difference Result 224 states and 228 transitions. [2024-11-08 10:12:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-08 10:12:08,080 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 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) Word has length 216 [2024-11-08 10:12:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:08,080 INFO L225 Difference]: With dead ends: 224 [2024-11-08 10:12:08,080 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:12:08,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2180, Invalid=4626, Unknown=0, NotChecked=0, Total=6806 [2024-11-08 10:12:08,082 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:08,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 10:12:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:12:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:12:08,083 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-08 10:12:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:12:08,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2024-11-08 10:12:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:08,083 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:12:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 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-08 10:12:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:12:08,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:12:08,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:12:08,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 10:12:08,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 10:12:08,292 INFO L407 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1] [2024-11-08 10:12:08,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:12:08,833 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:12:08,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~flag~0 [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!offset [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!base [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~flag~0 [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!offset [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2024-11-08 10:12:08,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-11-08 10:12:08,845 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!base [2024-11-08 10:12:08,846 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#a~0!base,]]] [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] [2024-11-08 10:12:08,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!offset [2024-11-08 10:12:08,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-08 10:12:08,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-08 10:12:08,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] [2024-11-08 10:12:08,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#a~0!offset [2024-11-08 10:12:08,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:12:08 BoogieIcfgContainer [2024-11-08 10:12:08,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:12:08,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:12:08,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:12:08,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:12:08,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:11:46" (3/4) ... [2024-11-08 10:12:08,851 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:12:08,856 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:12:08,857 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 10:12:08,857 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:12:08,857 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:12:08,921 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:12:08,922 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:12:08,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:12:08,922 INFO L158 Benchmark]: Toolchain (without parser) took 22752.68ms. Allocated memory was 190.8MB in the beginning and 400.6MB in the end (delta: 209.7MB). Free memory was 162.1MB in the beginning and 317.2MB in the end (delta: -155.1MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2024-11-08 10:12:08,922 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 146.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:12:08,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.83ms. Allocated memory is still 190.8MB. Free memory was 162.1MB in the beginning and 147.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 10:12:08,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.99ms. Allocated memory is still 190.8MB. Free memory was 147.6MB in the beginning and 146.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:12:08,923 INFO L158 Benchmark]: Boogie Preprocessor took 42.97ms. Allocated memory is still 190.8MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:12:08,923 INFO L158 Benchmark]: RCFGBuilder took 305.75ms. Allocated memory is still 190.8MB. Free memory was 144.5MB in the beginning and 130.9MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 10:12:08,923 INFO L158 Benchmark]: TraceAbstraction took 22098.03ms. Allocated memory was 190.8MB in the beginning and 400.6MB in the end (delta: 209.7MB). Free memory was 130.9MB in the beginning and 322.4MB in the end (delta: -191.6MB). Peak memory consumption was 215.2MB. Max. memory is 16.1GB. [2024-11-08 10:12:08,924 INFO L158 Benchmark]: Witness Printer took 72.57ms. Allocated memory is still 400.6MB. Free memory was 322.4MB in the beginning and 317.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:12:08,925 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.10ms. Allocated memory is still 146.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.83ms. Allocated memory is still 190.8MB. Free memory was 162.1MB in the beginning and 147.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.99ms. Allocated memory is still 190.8MB. Free memory was 147.6MB in the beginning and 146.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.97ms. Allocated memory is still 190.8MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 305.75ms. Allocated memory is still 190.8MB. Free memory was 144.5MB in the beginning and 130.9MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22098.03ms. Allocated memory was 190.8MB in the beginning and 400.6MB in the end (delta: 209.7MB). Free memory was 130.9MB in the beginning and 322.4MB in the end (delta: -191.6MB). Peak memory consumption was 215.2MB. Max. memory is 16.1GB. * Witness Printer took 72.57ms. Allocated memory is still 400.6MB. Free memory was 322.4MB in the beginning and 317.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~flag~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~flag~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#a~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#a~0!offset * 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: 13]: 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 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 13, TraceHistogramMax: 54, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1335 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1335 mSDsluCounter, 1023 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 836 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1066 IncrementalHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 187 mSDtfsCounter, 1066 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1853 GetRequests, 1519 SyntacticMatches, 2 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3052 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=12, InterpolantAutomatonStates: 275, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 576 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1825 NumberOfCodeBlocks, 1522 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2616 ConstructedInterpolants, 1 QuantifiedInterpolants, 12011 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3506 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 25174/31501 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: 23]: Loop Invariant Derived loop invariant: (((size == 1000000) && (i == 0)) || (size == 1000000)) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (1 <= flag) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((0 < flag) || ((flag == 0) && (i <= 999999))) || ((i == 0) && (flag == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:12:08,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE