./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-50.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 827549bec0a21b6c131dbbd0a60cc786df11c023034a28cad7dacc960e99c988 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:19:32,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:19:32,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:19:32,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:19:32,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:19:32,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:19:32,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:19:32,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:19:32,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:19:32,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:19:32,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:19:32,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:19:32,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:19:32,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:19:32,597 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:19:32,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:19:32,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:19:32,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:19:32,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:19:32,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:19:32,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:19:32,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:19:32,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:19:32,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:19:32,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:19:32,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:19:32,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:19:32,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:19:32,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:19:32,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:19:32,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:19:32,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:19:32,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:19:32,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:19:32,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:19:32,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:19:32,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:19:32,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:19:32,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:19:32,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:19:32,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:19:32,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:19:32,603 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 -> 827549bec0a21b6c131dbbd0a60cc786df11c023034a28cad7dacc960e99c988 [2024-11-22 10:19:32,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:19:32,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:19:32,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:19:32,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:19:32,839 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:19:32,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-50.i [2024-11-22 10:19:34,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:19:34,284 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:19:34,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-50.i [2024-11-22 10:19:34,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b68d36cd/073df5c12d904e2bae2ddcb2f56baf24/FLAGf03900d1f [2024-11-22 10:19:34,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b68d36cd/073df5c12d904e2bae2ddcb2f56baf24 [2024-11-22 10:19:34,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:19:34,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:19:34,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:19:34,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:19:34,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:19:34,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a5b591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34, skipping insertion in model container [2024-11-22 10:19:34,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:19:34,511 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-50.i[916,929] [2024-11-22 10:19:34,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:19:34,623 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:19:34,634 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-50.i[916,929] [2024-11-22 10:19:34,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:19:34,699 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:19:34,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34 WrapperNode [2024-11-22 10:19:34,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:19:34,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:19:34,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:19:34,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:19:34,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,764 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 285 [2024-11-22 10:19:34,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:19:34,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:19:34,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:19:34,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:19:34,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,819 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:19:34,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:19:34,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:19:34,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:19:34,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:19:34,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (1/1) ... [2024-11-22 10:19:34,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:19:34,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:19:34,893 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-22 10:19:34,897 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-22 10:19:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:19:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:19:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:19:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:19:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:19:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:19:35,030 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:19:35,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:19:35,562 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-22 10:19:35,562 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:19:35,576 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:19:35,576 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:19:35,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:19:35 BoogieIcfgContainer [2024-11-22 10:19:35,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:19:35,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:19:35,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:19:35,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:19:35,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:19:34" (1/3) ... [2024-11-22 10:19:35,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e54a5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:19:35, skipping insertion in model container [2024-11-22 10:19:35,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:19:34" (2/3) ... [2024-11-22 10:19:35,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e54a5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:19:35, skipping insertion in model container [2024-11-22 10:19:35,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:19:35" (3/3) ... [2024-11-22 10:19:35,585 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-50.i [2024-11-22 10:19:35,598 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:19:35,599 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:19:35,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:19:35,661 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;@3196364b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:19:35,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:19:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 87 states have internal predecessors, (119), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-22 10:19:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-22 10:19:35,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:19:35,682 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:19:35,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:19:35,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:19:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -480504621, now seen corresponding path program 1 times [2024-11-22 10:19:35,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:19:35,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248798808] [2024-11-22 10:19:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:19:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:19:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:19:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2024-11-22 10:19:36,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:19:36,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248798808] [2024-11-22 10:19:36,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248798808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:19:36,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621260094] [2024-11-22 10:19:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:19:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:19:36,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:19:36,049 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-22 10:19:36,050 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-22 10:19:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:19:36,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:19:36,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:19:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2024-11-22 10:19:36,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:19:36,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621260094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:19:36,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:19:36,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:19:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526967874] [2024-11-22 10:19:36,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:19:36,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:19:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:19:36,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:19:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:19:36,307 INFO L87 Difference]: Start difference. First operand has 126 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 87 states have internal predecessors, (119), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-22 10:19:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:19:36,333 INFO L93 Difference]: Finished difference Result 249 states and 420 transitions. [2024-11-22 10:19:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:19:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 243 [2024-11-22 10:19:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:19:36,343 INFO L225 Difference]: With dead ends: 249 [2024-11-22 10:19:36,343 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 10:19:36,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:19:36,348 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:19:36,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:19:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 10:19:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-22 10:19:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-22 10:19:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 186 transitions. [2024-11-22 10:19:36,392 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 186 transitions. Word has length 243 [2024-11-22 10:19:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:19:36,393 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 186 transitions. [2024-11-22 10:19:36,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-22 10:19:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 186 transitions. [2024-11-22 10:19:36,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-22 10:19:36,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:19:36,397 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:19:36,404 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-22 10:19:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:19:36,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:19:36,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:19:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 429411549, now seen corresponding path program 1 times [2024-11-22 10:19:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:19:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821989891] [2024-11-22 10:19:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:19:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:19:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:19:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-22 10:19:37,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:19:37,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821989891] [2024-11-22 10:19:37,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821989891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:19:37,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:19:37,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:19:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531355185] [2024-11-22 10:19:37,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:19:37,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:19:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:19:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:19:37,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:19:37,108 INFO L87 Difference]: Start difference. First operand 122 states and 186 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-22 10:19:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:19:37,217 INFO L93 Difference]: Finished difference Result 360 states and 552 transitions. [2024-11-22 10:19:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:19:37,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 243 [2024-11-22 10:19:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:19:37,224 INFO L225 Difference]: With dead ends: 360 [2024-11-22 10:19:37,225 INFO L226 Difference]: Without dead ends: 241 [2024-11-22 10:19:37,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 10:19:37,230 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 97 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:19:37,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 352 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:19:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-22 10:19:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2024-11-22 10:19:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 162 states have (on average 1.345679012345679) internal successors, (218), 162 states have internal predecessors, (218), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-22 10:19:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 366 transitions. [2024-11-22 10:19:37,268 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 366 transitions. Word has length 243 [2024-11-22 10:19:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:19:37,268 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 366 transitions. [2024-11-22 10:19:37,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-22 10:19:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 366 transitions. [2024-11-22 10:19:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-22 10:19:37,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:19:37,271 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:19:37,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:19:37,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:19:37,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:19:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1109469919, now seen corresponding path program 1 times [2024-11-22 10:19:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:19:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882587403] [2024-11-22 10:19:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:19:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:19:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:19:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 9 proven. 99 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-22 10:19:37,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:19:37,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882587403] [2024-11-22 10:19:37,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882587403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:19:37,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512449785] [2024-11-22 10:19:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:19:37,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:19:37,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:19:37,984 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-22 10:19:37,986 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-22 10:19:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:19:38,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 10:19:38,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:19:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 438 proven. 99 refuted. 0 times theorem prover too weak. 2127 trivial. 0 not checked. [2024-11-22 10:19:38,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:19:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 9 proven. 99 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-22 10:19:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512449785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:19:38,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 10:19:38,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-22 10:19:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146935219] [2024-11-22 10:19:38,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 10:19:38,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 10:19:38,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:19:38,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 10:19:38,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:19:38,979 INFO L87 Difference]: Start difference. First operand 239 states and 366 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 3 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2024-11-22 10:19:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:19:39,438 INFO L93 Difference]: Finished difference Result 491 states and 745 transitions. [2024-11-22 10:19:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 10:19:39,439 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 3 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) Word has length 243 [2024-11-22 10:19:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:19:39,442 INFO L225 Difference]: With dead ends: 491 [2024-11-22 10:19:39,442 INFO L226 Difference]: Without dead ends: 255 [2024-11-22 10:19:39,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-22 10:19:39,444 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 229 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:19:39,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 758 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:19:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-22 10:19:39,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2024-11-22 10:19:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 168 states have (on average 1.3214285714285714) internal successors, (222), 168 states have internal predecessors, (222), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-22 10:19:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 370 transitions. [2024-11-22 10:19:39,471 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 370 transitions. Word has length 243 [2024-11-22 10:19:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:19:39,473 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 370 transitions. [2024-11-22 10:19:39,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 3 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2024-11-22 10:19:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 370 transitions. [2024-11-22 10:19:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-22 10:19:39,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:19:39,478 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:19:39,486 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-22 10:19:39,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 10:19:39,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:19:39,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:19:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1939008356, now seen corresponding path program 1 times [2024-11-22 10:19:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:19:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717385922] [2024-11-22 10:19:39,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:19:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:19:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:19:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567563466] [2024-11-22 10:19:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:19:39,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:19:39,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:19:39,890 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-22 10:19:39,893 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-22 10:19:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:19:40,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 10:19:40,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:19:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1280 proven. 402 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-22 10:19:46,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:19:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:19:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717385922] [2024-11-22 10:19:54,886 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:19:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567563466] [2024-11-22 10:19:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567563466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:19:54,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:19:54,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2024-11-22 10:19:54,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016545232] [2024-11-22 10:19:54,887 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 10:19:54,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 10:19:54,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:19:54,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 10:19:54,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=772, Unknown=2, NotChecked=0, Total=930 [2024-11-22 10:19:54,890 INFO L87 Difference]: Start difference. First operand 247 states and 370 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 20 states have internal predecessors, (89), 6 states have call successors, (37), 6 states have call predecessors, (37), 10 states have return successors, (37), 6 states have call predecessors, (37), 6 states have call successors, (37) [2024-11-22 10:20:04,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:08,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:12,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:16,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:20,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:24,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:28,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:32,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:36,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:41,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:45,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:49,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:53,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:20:57,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:21:01,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:21:05,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:21:09,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-22 10:21:14,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]