./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.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 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:34:19,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:34:19,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:34:19,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:34:19,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:34:19,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:34:19,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:34:19,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:34:19,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:34:19,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:34:19,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:34:19,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:34:19,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:34:19,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:34:19,842 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:34:19,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:34:19,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:34:19,842 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:34:19,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:34:19,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:34:19,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:34:19,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:34:19,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:34:19,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:34:19,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:34:19,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:34:19,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:34:19,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:34:19,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:34:19,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:34:19,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:34:19,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:34:19,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:34:19,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:34:19,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:34:19,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:34:19,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:34:19,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:34:19,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:34:19,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:34:19,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:34:19,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:34:19,850 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 -> 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 [2024-11-20 06:34:20,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:34:20,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:34:20,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:34:20,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:34:20,053 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:34:20,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2024-11-20 06:34:21,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:34:21,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:34:21,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2024-11-20 06:34:21,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dabfd7d/69ea3a1badfd4a129e8e52ce182d9c38/FLAG675440bd1 [2024-11-20 06:34:21,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dabfd7d/69ea3a1badfd4a129e8e52ce182d9c38 [2024-11-20 06:34:21,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:34:21,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:34:21,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:34:21,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:34:21,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:34:21,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93e942e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21, skipping insertion in model container [2024-11-20 06:34:21,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:34:21,600 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-1loop_file-40.i[915,928] [2024-11-20 06:34:21,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:34:21,659 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:34:21,670 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-1loop_file-40.i[915,928] [2024-11-20 06:34:21,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:34:21,708 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:34:21,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21 WrapperNode [2024-11-20 06:34:21,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:34:21,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:34:21,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:34:21,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:34:21,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,746 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-20 06:34:21,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:34:21,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:34:21,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:34:21,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:34:21,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,769 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-20 06:34:21,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:34:21,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:34:21,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:34:21,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:34:21,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (1/1) ... [2024-11-20 06:34:21,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:34:21,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:34:21,807 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-20 06:34:21,809 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-20 06:34:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:34:21,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:34:21,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:34:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:34:21,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:34:21,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:34:21,901 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:34:21,904 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:34:22,122 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-20 06:34:22,123 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:34:22,134 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:34:22,134 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:34:22,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:34:22 BoogieIcfgContainer [2024-11-20 06:34:22,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:34:22,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:34:22,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:34:22,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:34:22,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:34:21" (1/3) ... [2024-11-20 06:34:22,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5093aa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:34:22, skipping insertion in model container [2024-11-20 06:34:22,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:21" (2/3) ... [2024-11-20 06:34:22,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5093aa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:34:22, skipping insertion in model container [2024-11-20 06:34:22,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:34:22" (3/3) ... [2024-11-20 06:34:22,141 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i [2024-11-20 06:34:22,172 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:34:22,172 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:34:22,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:34:22,223 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;@700cc197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:34:22,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:34:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 06:34:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:34:22,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:34:22,234 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:34:22,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:34:22,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:34:22,238 INFO L85 PathProgramCache]: Analyzing trace with hash 491427934, now seen corresponding path program 1 times [2024-11-20 06:34:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:34:22,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516168026] [2024-11-20 06:34:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:34:22,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:34:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:34:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:34:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:34:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:34:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:34:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:34:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:34:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:34:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:34:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:34:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:34:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:34:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:34:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:34:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:34:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 06:34:22,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:34:22,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516168026] [2024-11-20 06:34:22,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516168026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:34:22,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:34:22,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:34:22,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640106004] [2024-11-20 06:34:22,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:34:22,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:34:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:34:22,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:34:22,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:34:22,549 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 06:34:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:34:22,577 INFO L93 Difference]: Finished difference Result 99 states and 160 transitions. [2024-11-20 06:34:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:34:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-20 06:34:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:34:22,590 INFO L225 Difference]: With dead ends: 99 [2024-11-20 06:34:22,594 INFO L226 Difference]: Without dead ends: 47 [2024-11-20 06:34:22,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-20 06:34:22,611 INFO L432 NwaCegarLoop]: 71 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, 71 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-20 06:34:22,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:34:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-20 06:34:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-20 06:34:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 06:34:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-20 06:34:22,647 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 97 [2024-11-20 06:34:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:34:22,647 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-20 06:34:22,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 06:34:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-20 06:34:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:34:22,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:34:22,652 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:34:22,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:34:22,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:34:22,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:34:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1414912980, now seen corresponding path program 1 times [2024-11-20 06:34:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:34:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886152552] [2024-11-20 06:34:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:34:22,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:34:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:34:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:34:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:34:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:34:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:34:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:34:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:34:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:34:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:34:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:34:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:34:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:34:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:34:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:34:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:34:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 06:34:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:34:22,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886152552] [2024-11-20 06:34:22,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886152552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:34:22,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:34:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:34:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694800885] [2024-11-20 06:34:22,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:34:22,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:34:22,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:34:22,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:34:22,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:34:22,840 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 06:34:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:34:22,875 INFO L93 Difference]: Finished difference Result 102 states and 143 transitions. [2024-11-20 06:34:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:34:22,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-20 06:34:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:34:22,877 INFO L225 Difference]: With dead ends: 102 [2024-11-20 06:34:22,878 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 06:34:22,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-20 06:34:22,879 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 15 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:34:22,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:34:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 06:34:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2024-11-20 06:34:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 06:34:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-20 06:34:22,890 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 97 [2024-11-20 06:34:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:34:22,891 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-20 06:34:22,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 06:34:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-20 06:34:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:34:22,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:34:22,892 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:34:22,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:34:22,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:34:22,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:34:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1105046954, now seen corresponding path program 1 times [2024-11-20 06:34:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:34:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676239856] [2024-11-20 06:34:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:34:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:34:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:34:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890011715] [2024-11-20 06:34:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:34:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:34:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:34:22,982 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-20 06:34:22,983 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-20 06:34:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:34:23,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:34:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:34:23,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:34:23,185 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:34:23,186 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:34:23,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 06:34:23,388 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-20 06:34:23,391 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 06:34:23,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:34:23,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:34:23 BoogieIcfgContainer [2024-11-20 06:34:23,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:34:23,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:34:23,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:34:23,458 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:34:23,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:34:22" (3/4) ... [2024-11-20 06:34:23,460 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:34:23,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:34:23,462 INFO L158 Benchmark]: Toolchain (without parser) took 2018.88ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 81.4MB in the end (delta: 23.8MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-20 06:34:23,462 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:34:23,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.08ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 90.8MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 06:34:23,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.93ms. Allocated memory is still 176.2MB. Free memory was 90.8MB in the beginning and 88.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:34:23,463 INFO L158 Benchmark]: Boogie Preprocessor took 31.61ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:34:23,463 INFO L158 Benchmark]: RCFGBuilder took 354.52ms. Allocated memory is still 176.2MB. Free memory was 86.3MB in the beginning and 70.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:34:23,463 INFO L158 Benchmark]: TraceAbstraction took 1321.83ms. Allocated memory is still 176.2MB. Free memory was 70.2MB in the beginning and 81.7MB in the end (delta: -11.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:34:23,463 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 176.2MB. Free memory was 81.7MB in the beginning and 81.4MB in the end (delta: 385.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:34:23,466 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.09ms. Allocated memory is still 117.4MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.08ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 90.8MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.93ms. Allocated memory is still 176.2MB. Free memory was 90.8MB in the beginning and 88.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.61ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.52ms. Allocated memory is still 176.2MB. Free memory was 86.3MB in the beginning and 70.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1321.83ms. Allocated memory is still 176.2MB. Free memory was 70.2MB in the beginning and 81.7MB in the end (delta: -11.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 176.2MB. Free memory was 81.7MB in the beginning and 81.4MB in the end (delta: 385.8kB). 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 someBinaryFLOATComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed short int var_1_7 = 5; [L26] unsigned long int var_1_9 = 256; [L27] signed char var_1_10 = 10; [L28] signed char var_1_11 = 4; [L29] float var_1_12 = 32.4; [L30] float var_1_13 = 1.2; [L31] float var_1_14 = 64.8; [L32] float var_1_15 = 127.3; [L33] float var_1_16 = 4.02; [L34] signed char var_1_17 = -32; [L35] unsigned long int last_1_var_1_9 = 256; VAL [isInitial=0, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L95] COND TRUE k_loop < 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_3=0, var_1_7=5, var_1_9=256] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=0, var_1_7=5, var_1_9=256] [L62] var_1_3 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L63] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_7=5, var_1_9=256] [L64] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=5, var_1_9=256] [L65] var_1_7 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L66] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L67] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L67] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L68] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=10, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L69] var_1_10 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L70] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L71] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L71] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=4, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L72] var_1_11 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L74] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_13=6/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= 0.0F && 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_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L76] RET assume_abort_if_not((var_1_13 >= 0.0F && 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_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_14=324/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L78] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_15=1273/10, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L80] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_16=201/50, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L82] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=256] [L97] RET updateVariables() [L98] CALL step() [L39] COND TRUE (var_1_10 - var_1_11) >= last_1_var_1_9 [L40] var_1_9 = (var_1_11 + 2u) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=162/5, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L42] COND FALSE !(\read(var_1_2)) [L45] var_1_12 = ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-32, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L47] var_1_17 = -4 VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L48] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return (((var_1_2 ? ((var_1_3 && (var_1_12 <= (- 63.9f))) ? ((var_1_12 >= var_1_12) ? (((var_1_9 / var_1_7) <= var_1_9) ? (var_1_1 == ((signed long int) var_1_9)) : 1) : 1) : 1) : 1) && (((var_1_10 - var_1_11) >= last_1_var_1_9) ? (var_1_9 == ((unsigned long int) (var_1_11 + 2u))) : 1)) && (var_1_2 ? (var_1_12 == ((float) ((((((((var_1_13 - var_1_14) < 0 ) ? -(var_1_13 - var_1_14) : (var_1_13 - var_1_14)))) < (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? (((((var_1_13 - var_1_14) < 0 ) ? -(var_1_13 - var_1_14) : (var_1_13 - var_1_14)))) : (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))))))) : (var_1_12 == ((float) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))))) && (var_1_17 == ((signed char) -4)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=256, var_1_10=-1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=0, var_1_17=-4, var_1_1=-4, var_1_2=0, var_1_3=-255, var_1_7=3, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 145 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 840/840 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-20 06:34:23,486 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.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 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:34:25,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:34:25,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:34:25,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:34:25,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:34:25,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:34:25,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:34:25,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:34:25,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:34:25,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:34:25,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:34:25,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:34:25,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:34:25,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:34:25,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:34:25,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:34:25,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:34:25,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:34:25,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:34:25,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:34:25,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:34:25,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:34:25,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:34:25,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:34:25,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:34:25,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:34:25,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:34:25,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:34:25,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:34:25,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:34:25,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:34:25,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:34:25,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:34:25,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:34:25,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:34:25,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:34:25,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:34:25,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:34:25,327 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:34:25,327 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:34:25,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:34:25,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:34:25,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:34:25,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:34:25,330 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 -> 08c7e61f5459d5fc0a0cd65e2d0a5eb61e01ee4aec3eee7dfe70e8ab0a3470e9 [2024-11-20 06:34:25,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:34:25,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:34:25,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:34:25,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:34:25,593 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:34:25,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2024-11-20 06:34:26,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:34:27,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:34:27,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-40.i [2024-11-20 06:34:27,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e2e8c159/789b52d694c1473884bb2dbf6305b019/FLAG0cf9a81f0 [2024-11-20 06:34:27,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e2e8c159/789b52d694c1473884bb2dbf6305b019 [2024-11-20 06:34:27,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:34:27,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:34:27,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:34:27,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:34:27,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:34:27,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360bde35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27, skipping insertion in model container [2024-11-20 06:34:27,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:34:27,637 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-1loop_file-40.i[915,928] [2024-11-20 06:34:27,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:34:27,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:34:27,707 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-1loop_file-40.i[915,928] [2024-11-20 06:34:27,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:34:27,734 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:34:27,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27 WrapperNode [2024-11-20 06:34:27,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:34:27,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:34:27,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:34:27,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:34:27,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,769 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-20 06:34:27,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:34:27,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:34:27,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:34:27,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:34:27,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,799 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-20 06:34:27,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:34:27,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:34:27,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:34:27,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:34:27,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (1/1) ... [2024-11-20 06:34:27,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:34:27,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:34:27,868 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-20 06:34:27,877 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-20 06:34:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:34:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:34:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:34:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:34:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:34:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:34:27,967 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:34:27,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:34:28,431 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-20 06:34:28,431 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:34:28,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:34:28,444 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:34:28,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:34:28 BoogieIcfgContainer [2024-11-20 06:34:28,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:34:28,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:34:28,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:34:28,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:34:28,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:34:27" (1/3) ... [2024-11-20 06:34:28,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e478bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:34:28, skipping insertion in model container [2024-11-20 06:34:28,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:34:27" (2/3) ... [2024-11-20 06:34:28,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e478bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:34:28, skipping insertion in model container [2024-11-20 06:34:28,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:34:28" (3/3) ... [2024-11-20 06:34:28,452 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-40.i [2024-11-20 06:34:28,465 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:34:28,465 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:34:28,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:34:28,527 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;@6968bcc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:34:28,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:34:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 06:34:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:34:28,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:34:28,541 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:34:28,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:34:28,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:34:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash 491427934, now seen corresponding path program 1 times [2024-11-20 06:34:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:34:28,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897643107] [2024-11-20 06:34:28,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:34:28,559 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-20 06:34:28,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:34:28,562 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-20 06:34:28,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 (2)] Waiting until timeout for monitored process [2024-11-20 06:34:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:28,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:34:28,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:34:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-20 06:34:28,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:34:28,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:34:28,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897643107] [2024-11-20 06:34:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897643107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:34:28,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:34:28,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:34:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530500760] [2024-11-20 06:34:28,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:34:28,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:34:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:34:28,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:34:28,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:34:28,905 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 06:34:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:34:28,930 INFO L93 Difference]: Finished difference Result 99 states and 160 transitions. [2024-11-20 06:34:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:34:28,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-20 06:34:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:34:28,938 INFO L225 Difference]: With dead ends: 99 [2024-11-20 06:34:28,938 INFO L226 Difference]: Without dead ends: 47 [2024-11-20 06:34:28,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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-20 06:34:28,943 INFO L432 NwaCegarLoop]: 71 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, 71 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-20 06:34:28,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:34:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-20 06:34:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-20 06:34:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 06:34:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-20 06:34:28,973 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 97 [2024-11-20 06:34:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:34:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-20 06:34:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 06:34:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-20 06:34:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:34:28,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:34:28,976 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:34:28,986 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 (2)] Ended with exit code 0 [2024-11-20 06:34:29,176 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-20 06:34:29,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:34:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:34:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1414912980, now seen corresponding path program 1 times [2024-11-20 06:34:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:34:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874280997] [2024-11-20 06:34:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:34:29,178 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-20 06:34:29,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:34:29,181 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-20 06:34:29,182 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-20 06:34:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:29,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 06:34:29,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:34:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 06:34:29,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:34:29,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:34:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874280997] [2024-11-20 06:34:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874280997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:34:29,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:34:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:34:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822864206] [2024-11-20 06:34:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:34:29,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:34:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:34:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:34:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:34:29,460 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 06:34:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:34:29,606 INFO L93 Difference]: Finished difference Result 102 states and 143 transitions. [2024-11-20 06:34:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:34:29,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-11-20 06:34:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:34:29,611 INFO L225 Difference]: With dead ends: 102 [2024-11-20 06:34:29,612 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 06:34:29,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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-20 06:34:29,613 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:34:29,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 126 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:34:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 06:34:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2024-11-20 06:34:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 06:34:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-20 06:34:29,627 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 97 [2024-11-20 06:34:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:34:29,628 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-20 06:34:29,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 06:34:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-20 06:34:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 06:34:29,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:34:29,630 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:34:29,641 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-20 06:34:29,831 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-20 06:34:29,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:34:29,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:34:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1105046954, now seen corresponding path program 1 times [2024-11-20 06:34:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:34:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006468375] [2024-11-20 06:34:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:34:29,835 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-20 06:34:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:34:29,837 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-20 06:34:29,838 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-20 06:34:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:34:30,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 06:34:30,078 INFO L278 TraceCheckSpWp]: Computing forward predicates...