./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.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 e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:30:27,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:30:27,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:30:27,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:30:27,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:30:27,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:30:27,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:30:27,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:30:27,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:30:27,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:30:27,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:30:27,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:30:27,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:30:27,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:30:27,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:30:27,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:30:27,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:30:27,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:30:27,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:30:27,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:30:27,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:30:27,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:30:27,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:30:27,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:30:27,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:30:27,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:30:27,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:30:27,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:30:27,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:30:27,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:30:27,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:30:27,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:30:27,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:30:27,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:30:27,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:30:27,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:30:27,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:30:27,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:30:27,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:30:27,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:30:27,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:30:27,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:30:27,671 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 -> e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f [2024-11-12 05:30:27,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:30:27,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:30:27,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:30:27,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:30:27,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:30:27,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-12 05:30:29,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:30:29,635 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:30:29,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-12 05:30:29,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f2228f5/74cd44326b634a8e96195cd1db1b3059/FLAG00689708d [2024-11-12 05:30:29,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f2228f5/74cd44326b634a8e96195cd1db1b3059 [2024-11-12 05:30:29,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:30:29,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:30:29,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:30:29,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:30:29,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:30:29,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:30:29" (1/1) ... [2024-11-12 05:30:29,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38470cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:29, skipping insertion in model container [2024-11-12 05:30:29,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:30:29" (1/1) ... [2024-11-12 05:30:29,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:30:29,878 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_25-while_file-37.i[915,928] [2024-11-12 05:30:29,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:30:29,963 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:30:29,975 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_25-while_file-37.i[915,928] [2024-11-12 05:30:30,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:30:30,032 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:30:30,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30 WrapperNode [2024-11-12 05:30:30,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:30:30,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:30:30,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:30:30,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:30:30,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,171 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-12 05:30:30,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:30:30,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:30:30,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:30:30,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:30:30,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,223 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-12 05:30:30,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:30:30,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:30:30,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:30:30,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:30:30,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (1/1) ... [2024-11-12 05:30:30,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:30:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:30:30,308 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-12 05:30:30,311 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-12 05:30:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:30:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:30:30,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:30:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:30:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:30:30,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:30:30,413 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:30:30,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:30:30,767 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 05:30:30,770 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:30:30,790 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:30:30,790 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:30:30,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:30:30 BoogieIcfgContainer [2024-11-12 05:30:30,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:30:30,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:30:30,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:30:30,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:30:30,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:30:29" (1/3) ... [2024-11-12 05:30:30,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669db3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:30:30, skipping insertion in model container [2024-11-12 05:30:30,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:30" (2/3) ... [2024-11-12 05:30:30,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669db3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:30:30, skipping insertion in model container [2024-11-12 05:30:30,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:30:30" (3/3) ... [2024-11-12 05:30:30,801 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-12 05:30:30,820 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:30:30,821 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:30:30,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:30:30,892 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;@5089a1f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:30:30,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:30:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:30:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 05:30:30,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:30,908 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:30,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:30,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1174007771, now seen corresponding path program 1 times [2024-11-12 05:30:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:30:30,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858404160] [2024-11-12 05:30:30,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:30:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:30:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:30:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:30:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:30:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:30:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:30:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:30:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:30:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:30:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:30:31,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:30:31,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858404160] [2024-11-12 05:30:31,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858404160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:30:31,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:30:31,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:30:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066515417] [2024-11-12 05:30:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:30:31,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:30:31,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:30:31,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:30:31,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:30:31,274 INFO L87 Difference]: Start difference. First operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:30:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:30:31,296 INFO L93 Difference]: Finished difference Result 93 states and 147 transitions. [2024-11-12 05:30:31,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:30:31,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2024-11-12 05:30:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:30:31,307 INFO L225 Difference]: With dead ends: 93 [2024-11-12 05:30:31,307 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 05:30:31,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-12 05:30:31,313 INFO L435 NwaCegarLoop]: 65 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, 65 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-12 05:30:31,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:30:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 05:30:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 05:30:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:30:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-12 05:30:31,356 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 68 [2024-11-12 05:30:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:30:31,357 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-12 05:30:31,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:30:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-12 05:30:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 05:30:31,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:31,360 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:31,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:30:31,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:31,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:31,362 INFO L85 PathProgramCache]: Analyzing trace with hash -108979235, now seen corresponding path program 1 times [2024-11-12 05:30:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:30:31,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093989296] [2024-11-12 05:30:31,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:30:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:30:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:30:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:30:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:30:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:30:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:30:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:30:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:30:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:30:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:30:31,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:30:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093989296] [2024-11-12 05:30:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093989296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:30:31,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:30:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:30:31,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634250826] [2024-11-12 05:30:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:30:31,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:30:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:30:31,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:30:31,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:30:31,773 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:30:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:30:31,815 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2024-11-12 05:30:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:30:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2024-11-12 05:30:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:30:31,819 INFO L225 Difference]: With dead ends: 89 [2024-11-12 05:30:31,819 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 05:30:31,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-12 05:30:31,822 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:30:31,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:30:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 05:30:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 05:30:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:30:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-12 05:30:31,836 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 68 [2024-11-12 05:30:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:30:31,838 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-12 05:30:31,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:30:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-12 05:30:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 05:30:31,843 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:31,843 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:30:31,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:31,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -918325861, now seen corresponding path program 1 times [2024-11-12 05:30:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:30:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047251986] [2024-11-12 05:30:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:30:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:30:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:30:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:30:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:30:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:30:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:30:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:30:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:30:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:30:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 05:30:32,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:30:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047251986] [2024-11-12 05:30:32,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047251986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:30:32,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289002429] [2024-11-12 05:30:32,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:32,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:30:32,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:30:32,229 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-12 05:30:32,234 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-12 05:30:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:32,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:30:32,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:30:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 05:30:32,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:30:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 05:30:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289002429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:30:32,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:30:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 05:30:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575338017] [2024-11-12 05:30:32,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:30:32,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:30:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:30:32,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:30:32,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:30:32,782 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-12 05:30:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:30:32,958 INFO L93 Difference]: Finished difference Result 95 states and 130 transitions. [2024-11-12 05:30:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:30:32,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 68 [2024-11-12 05:30:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:30:32,961 INFO L225 Difference]: With dead ends: 95 [2024-11-12 05:30:32,962 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 05:30:32,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:30:32,964 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 103 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:30:32,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 98 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:30:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 05:30:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-12 05:30:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:30:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2024-11-12 05:30:32,974 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 68 [2024-11-12 05:30:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:30:32,975 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2024-11-12 05:30:32,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-12 05:30:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2024-11-12 05:30:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 05:30:32,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:32,976 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:32,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:30:33,180 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-12 05:30:33,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:33,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:33,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2055988095, now seen corresponding path program 1 times [2024-11-12 05:30:33,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:30:33,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706961685] [2024-11-12 05:30:33,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:30:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:30:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:30:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:30:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:30:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:30:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:30:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:30:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:30:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:30:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 05:30:33,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:30:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706961685] [2024-11-12 05:30:33,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706961685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:30:33,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797704036] [2024-11-12 05:30:33,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:33,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:30:33,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:30:33,485 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-12 05:30:33,490 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-12 05:30:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:33,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 05:30:33,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:30:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 05:30:33,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:30:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 05:30:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797704036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:30:33,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:30:33,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-12 05:30:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795394179] [2024-11-12 05:30:33,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:30:33,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 05:30:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:30:33,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 05:30:33,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:30:33,849 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-12 05:30:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:30:34,051 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2024-11-12 05:30:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 05:30:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 70 [2024-11-12 05:30:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:30:34,053 INFO L225 Difference]: With dead ends: 101 [2024-11-12 05:30:34,053 INFO L226 Difference]: Without dead ends: 54 [2024-11-12 05:30:34,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:30:34,054 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:30:34,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 155 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:30:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-12 05:30:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-11-12 05:30:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:30:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-11-12 05:30:34,062 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 70 [2024-11-12 05:30:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:30:34,063 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-12 05:30:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-12 05:30:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-12 05:30:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 05:30:34,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:34,065 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:34,086 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-12 05:30:34,268 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-12 05:30:34,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:34,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1046819240, now seen corresponding path program 1 times [2024-11-12 05:30:34,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:30:34,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997567316] [2024-11-12 05:30:34,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:34,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:30:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:30:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368547931] [2024-11-12 05:30:34,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:30:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:30:34,312 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-12 05:30:34,334 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-12 05:30:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:34,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 05:30:34,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:30:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:30:34,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:30:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:30:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997567316] [2024-11-12 05:30:34,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 05:30:34,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368547931] [2024-11-12 05:30:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368547931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:30:34,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:30:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:30:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623411183] [2024-11-12 05:30:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:30:34,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:30:34,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:30:34,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:30:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:30:34,684 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:30:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:30:34,829 INFO L93 Difference]: Finished difference Result 147 states and 192 transitions. [2024-11-12 05:30:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:30:34,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-11-12 05:30:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:30:34,832 INFO L225 Difference]: With dead ends: 147 [2024-11-12 05:30:34,832 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 05:30:34,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:30:34,833 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:30:34,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 147 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:30:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 05:30:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2024-11-12 05:30:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 05:30:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2024-11-12 05:30:34,852 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 71 [2024-11-12 05:30:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:30:34,853 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2024-11-12 05:30:34,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:30:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2024-11-12 05:30:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 05:30:34,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:34,854 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:34,872 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-12 05:30:35,055 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-12 05:30:35,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:35,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 762866719, now seen corresponding path program 1 times [2024-11-12 05:30:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:30:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571484094] [2024-11-12 05:30:35,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:30:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:30:35,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148252259] [2024-11-12 05:30:35,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:35,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:30:35,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:30:35,109 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-12 05:30:35,110 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-12 05:30:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:30:35,184 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:30:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:30:35,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:30:35,268 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:30:35,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:30:35,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 05:30:35,472 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-12 05:30:35,475 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 05:30:35,540 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:30:35,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:30:35 BoogieIcfgContainer [2024-11-12 05:30:35,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:30:35,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:30:35,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:30:35,547 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:30:35,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:30:30" (3/4) ... [2024-11-12 05:30:35,550 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:30:35,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:30:35,552 INFO L158 Benchmark]: Toolchain (without parser) took 5885.14ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 116.0MB in the beginning and 108.4MB in the end (delta: 7.6MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-11-12 05:30:35,552 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:30:35,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.79ms. Allocated memory is still 184.5MB. Free memory was 116.0MB in the beginning and 156.2MB in the end (delta: -40.2MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-11-12 05:30:35,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.62ms. Allocated memory is still 184.5MB. Free memory was 156.2MB in the beginning and 152.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:30:35,553 INFO L158 Benchmark]: Boogie Preprocessor took 94.98ms. Allocated memory is still 184.5MB. Free memory was 152.5MB in the beginning and 148.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:30:35,554 INFO L158 Benchmark]: RCFGBuilder took 522.45ms. Allocated memory is still 184.5MB. Free memory was 148.3MB in the beginning and 127.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 05:30:35,554 INFO L158 Benchmark]: TraceAbstraction took 4753.05ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 126.3MB in the beginning and 109.4MB in the end (delta: 16.9MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-12 05:30:35,555 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 222.3MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:30:35,556 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.16ms. Allocated memory is still 117.4MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.79ms. Allocated memory is still 184.5MB. Free memory was 116.0MB in the beginning and 156.2MB in the end (delta: -40.2MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.62ms. Allocated memory is still 184.5MB. Free memory was 156.2MB in the beginning and 152.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.98ms. Allocated memory is still 184.5MB. Free memory was 152.5MB in the beginning and 148.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 522.45ms. Allocated memory is still 184.5MB. Free memory was 148.3MB in the beginning and 127.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4753.05ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 126.3MB in the beginning and 109.4MB in the end (delta: 16.9MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 222.3MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of bitwiseOr at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned char var_1_6 = 4; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 64; [L27] unsigned long int var_1_9 = 64; [L28] unsigned long int var_1_10 = 1776833134; [L29] signed long int var_1_11 = -16; [L30] double var_1_12 = 0.25; [L31] double var_1_13 = 5.5; [L32] unsigned char last_1_var_1_8 = 64; [L33] signed long int last_1_var_1_11 = -16; VAL [isInitial=0, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L88] RET updateLastVariables() [L89] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L64] var_1_6 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L70] var_1_10 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_10 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L71] RET assume_abort_if_not(var_1_10 >= 1073741824) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L89] RET updateVariables() [L90] CALL step() [L37] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L37] COND TRUE ((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64 [L38] var_1_1 = ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L44] var_1_11 = var_1_1 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L45] COND TRUE var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2))) [L46] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=64] [L52] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, stepLocal_0=1, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=64] [L53] COND FALSE !(var_1_1 > stepLocal_0) [L56] var_1_9 = ((1228227409u + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L58] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L81-L82] return (((((((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64) ? (var_1_1 == ((unsigned char) ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))))) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_6)) : 1)) && ((var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2)))) ? (var_1_8 == ((unsigned char) var_1_6)) : (var_1_7 ? (var_1_8 == ((unsigned char) var_1_6)) : 1))) && ((var_1_1 > var_1_1) ? (var_1_9 == ((unsigned long int) var_1_2)) : (var_1_9 == ((unsigned long int) ((1228227409u + var_1_10) - var_1_11))))) && (var_1_11 == ((signed long int) var_1_1))) && (var_1_12 == ((double) var_1_13)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 581 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 260 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772 SizeOfPredicates, 8 NumberOfNonLiveVariables, 539 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 1152/1296 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:30:35,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:30:37,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:30:38,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:30:38,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:30:38,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:30:38,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:30:38,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:30:38,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:30:38,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:30:38,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:30:38,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:30:38,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:30:38,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:30:38,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:30:38,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:30:38,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:30:38,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:30:38,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:30:38,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:30:38,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:30:38,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:30:38,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:30:38,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:30:38,092 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:30:38,092 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:30:38,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:30:38,093 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:30:38,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:30:38,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:30:38,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:30:38,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:30:38,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:30:38,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:30:38,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:30:38,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:30:38,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:30:38,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:30:38,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:30:38,106 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:30:38,106 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:30:38,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:30:38,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:30:38,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:30:38,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:30:38,107 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 -> e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f [2024-11-12 05:30:38,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:30:38,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:30:38,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:30:38,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:30:38,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:30:38,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-12 05:30:40,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:30:40,362 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:30:40,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-12 05:30:40,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d713d5aa/7a49f5ac76d14ce6aa5b6402ec37f50f/FLAG2585dcb7b [2024-11-12 05:30:40,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d713d5aa/7a49f5ac76d14ce6aa5b6402ec37f50f [2024-11-12 05:30:40,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:30:40,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:30:40,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:30:40,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:30:40,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:30:40,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fcfa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40, skipping insertion in model container [2024-11-12 05:30:40,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:30:40,651 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_25-while_file-37.i[915,928] [2024-11-12 05:30:40,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:30:40,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:30:40,748 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_25-while_file-37.i[915,928] [2024-11-12 05:30:40,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:30:40,812 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:30:40,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40 WrapperNode [2024-11-12 05:30:40,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:30:40,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:30:40,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:30:40,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:30:40,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,868 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-12 05:30:40,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:30:40,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:30:40,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:30:40,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:30:40,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,904 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-12 05:30:40,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:30:40,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:30:40,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:30:40,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:30:40,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (1/1) ... [2024-11-12 05:30:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:30:40,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:30:40,980 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-12 05:30:40,986 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-12 05:30:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:30:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:30:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:30:41,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:30:41,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:30:41,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:30:41,128 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:30:41,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:30:41,476 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 05:30:41,476 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:30:41,492 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:30:41,493 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:30:41,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:30:41 BoogieIcfgContainer [2024-11-12 05:30:41,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:30:41,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:30:41,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:30:41,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:30:41,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:30:40" (1/3) ... [2024-11-12 05:30:41,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65081cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:30:41, skipping insertion in model container [2024-11-12 05:30:41,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:30:40" (2/3) ... [2024-11-12 05:30:41,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65081cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:30:41, skipping insertion in model container [2024-11-12 05:30:41,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:30:41" (3/3) ... [2024-11-12 05:30:41,516 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-37.i [2024-11-12 05:30:41,537 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:30:41,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:30:41,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:30:41,625 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;@48b91578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:30:41,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:30:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:30:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:30:41,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:41,642 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:41,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:41,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1910201472, now seen corresponding path program 1 times [2024-11-12 05:30:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:30:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963056161] [2024-11-12 05:30:41,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:41,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:30:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:30:41,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:30:41,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:30:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:41,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:30:41,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:30:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 05:30:41,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:30:41,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:30:41,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963056161] [2024-11-12 05:30:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963056161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:30:41,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:30:41,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:30:41,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248124321] [2024-11-12 05:30:41,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:30:41,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:30:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:30:41,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:30:41,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:30:41,963 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:30:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:30:41,983 INFO L93 Difference]: Finished difference Result 75 states and 117 transitions. [2024-11-12 05:30:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:30:41,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-12 05:30:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:30:41,992 INFO L225 Difference]: With dead ends: 75 [2024-11-12 05:30:41,993 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 05:30:41,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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-12 05:30:41,999 INFO L435 NwaCegarLoop]: 50 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, 50 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-12 05:30:42,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:30:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 05:30:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 05:30:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:30:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 05:30:42,064 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 65 [2024-11-12 05:30:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:30:42,066 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 05:30:42,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:30:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 05:30:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:30:42,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:42,071 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:42,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:30:42,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:30:42,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:42,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1776469694, now seen corresponding path program 1 times [2024-11-12 05:30:42,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:30:42,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398207355] [2024-11-12 05:30:42,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:42,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:30:42,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:30:42,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:30:42,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:30:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:42,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 05:30:42,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:30:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:30:42,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:30:42,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:30:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398207355] [2024-11-12 05:30:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398207355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:30:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:30:42,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:30:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338239245] [2024-11-12 05:30:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:30:42,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:30:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:30:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:30:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:30:42,500 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:30:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:30:42,595 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-11-12 05:30:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:30:42,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2024-11-12 05:30:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:30:42,602 INFO L225 Difference]: With dead ends: 71 [2024-11-12 05:30:42,602 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 05:30:42,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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-12 05:30:42,605 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:30:42,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:30:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 05:30:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 05:30:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:30:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2024-11-12 05:30:42,619 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 65 [2024-11-12 05:30:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:30:42,620 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2024-11-12 05:30:42,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:30:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2024-11-12 05:30:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:30:42,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:42,623 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:30:42,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 05:30:42,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:30:42,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:42,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1833727996, now seen corresponding path program 1 times [2024-11-12 05:30:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:30:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136595] [2024-11-12 05:30:42,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:30:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:30:42,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:30:42,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 05:30:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:42,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 05:30:42,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:31:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 05:31:06,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:31:06,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:31:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136595] [2024-11-12 05:31:06,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:31:06,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:31:06,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 05:31:06,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223852527] [2024-11-12 05:31:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:31:06,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 05:31:06,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:31:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 05:31:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:31:06,602 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:31:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:31:08,337 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2024-11-12 05:31:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 05:31:08,339 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2024-11-12 05:31:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:31:08,341 INFO L225 Difference]: With dead ends: 87 [2024-11-12 05:31:08,341 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 05:31:08,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-12 05:31:08,343 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 68 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 05:31:08,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 160 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 05:31:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 05:31:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-11-12 05:31:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:31:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-11-12 05:31:08,352 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 65 [2024-11-12 05:31:08,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:31:08,353 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-12 05:31:08,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:31:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-12 05:31:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 05:31:08,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:31:08,355 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:31:08,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 05:31:08,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:31:08,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:31:08,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:31:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash 623397682, now seen corresponding path program 1 times [2024-11-12 05:31:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:31:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77956394] [2024-11-12 05:31:08,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:31:08,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:31:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:31:08,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:31:08,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 05:31:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:31:08,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 05:31:08,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:31:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 05:31:09,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:31:09,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:31:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77956394] [2024-11-12 05:31:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77956394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:31:09,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1098234347] [2024-11-12 05:31:09,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:31:09,379 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 05:31:09,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 05:31:09,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 05:31:09,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 05:31:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:31:09,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 05:31:09,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:31:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 05:31:32,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:31:32,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1098234347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:31:32,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:31:32,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2024-11-12 05:31:32,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139005146] [2024-11-12 05:31:32,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:31:32,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 05:31:32,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:31:32,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 05:31:32,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-12 05:31:32,187 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:31:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:31:43,449 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2024-11-12 05:31:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 05:31:43,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2024-11-12 05:31:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:31:43,459 INFO L225 Difference]: With dead ends: 120 [2024-11-12 05:31:43,459 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 05:31:43,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2024-11-12 05:31:43,461 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 72 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:31:43,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 221 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-12 05:31:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 05:31:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2024-11-12 05:31:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:31:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-11-12 05:31:43,474 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 66 [2024-11-12 05:31:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:31:43,474 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-11-12 05:31:43,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 05:31:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2024-11-12 05:31:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 05:31:43,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:31:43,476 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:31:43,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 05:31:43,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-12 05:31:43,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 05:31:43,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:31:43,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:31:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash 230370672, now seen corresponding path program 1 times [2024-11-12 05:31:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:31:43,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986472830] [2024-11-12 05:31:43,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:31:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:31:43,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:31:43,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:31:43,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 05:31:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:31:43,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 05:31:43,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:31:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 05:31:44,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:31:44,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:31:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986472830] [2024-11-12 05:31:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986472830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:31:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1138509118] [2024-11-12 05:31:44,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:31:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 05:31:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 05:31:44,803 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 05:31:44,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-12 05:31:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:31:45,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 05:31:45,122 INFO L279 TraceCheckSpWp]: Computing forward predicates...